Running as unit: rb-build-amd64_38-44110.service ==================================================================================== Thu Jan 23 01:11:10 UTC 2025 - running /srv/jenkins/bin/reproducible_build.sh (for job reproducible_builder_amd64_38) on jenkins, called using "infom02-amd64 infom01-amd64" as arguments. Thu Jan 23 01:11:10 UTC 2025 - actually running "reproducible_build.sh" (md5sum 68e686e434c9ab7bc3ec047d8b309cbc) as "/tmp/jenkins-script-yaXloj5h" $ git clone https://salsa.debian.org/qa/jenkins.debian.net.git ; more CONTRIBUTING Thu Jan 23 01:11:10 UTC 2025 - checking /var/lib/jenkins/offline_nodes if infom02-amd64.debian.net is marked as down. Thu Jan 23 01:11:10 UTC 2025 - checking via ssh if infom02-amd64.debian.net is up. removed '/tmp/read-only-fs-test-uK1x7n' Thu Jan 23 01:11:10 UTC 2025 - checking /var/lib/jenkins/offline_nodes if infom01-amd64.debian.net is marked as down. Thu Jan 23 01:11:10 UTC 2025 - checking via ssh if infom01-amd64.debian.net is up. removed '/tmp/read-only-fs-test-GXp6wb' ok, let's check if graph-tool is building anywhere yet… ok, graph-tool is not building anywhere… UPDATE 1 ============================================================================= Initialising reproducibly build of graph-tool in unstable on amd64 on jenkins now. 1st build will be done on infom02-amd64.debian.net. 2nd build will be done on infom01-amd64.debian.net. ============================================================================= Thu Jan 23 01:11:12 UTC 2025 I: starting to build graph-tool/unstable/amd64 on jenkins on '2025-01-23 01:11' Thu Jan 23 01:11:12 UTC 2025 I: The jenkins build log is/was available at https://jenkins.debian.net/userContent/reproducible/debian/build_service/amd64_38/44110/console.log 1737594672 amd64 unstable graph-tool Thu Jan 23 01:11:12 UTC 2025 I: Downloading source for unstable/graph-tool=2.77+ds-3 --2025-01-23 01:11:13-- http://deb.debian.org/debian/pool/main/g/graph-tool/graph-tool_2.77%2bds-3.dsc Connecting to 46.16.76.132:3128... connected. Proxy request sent, awaiting response... 200 OK Length: 2759 (2.7K) [text/prs.lines.tag] Saving to: ‘graph-tool_2.77+ds-3.dsc’ 0K .. 100% 391M=0s 2025-01-23 01:11:13 (391 MB/s) - ‘graph-tool_2.77+ds-3.dsc’ saved [2759/2759] --2025-01-23 01:11:13-- http://deb.debian.org/debian/pool/main/g/graph-tool/graph-tool_2.77%2bds-3.dsc Connecting to 46.16.76.132:3128... connected. Proxy request sent, awaiting response... 200 OK Length: 2759 (2.7K) [text/prs.lines.tag] Saving to: ‘graph-tool_2.77+ds-3.dsc’ 0K .. 100% 391M=0s 2025-01-23 01:11:13 (391 MB/s) - ‘graph-tool_2.77+ds-3.dsc’ saved [2759/2759] Thu Jan 23 01:11:13 UTC 2025 I: graph-tool_2.77+ds-3.dsc -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA512 Format: 3.0 (quilt) Source: graph-tool Binary: python3-graph-tool, graph-tool-doc Architecture: amd64 arm64 s390x ia64 loong64 ppc64 riscv64 all Version: 2.77+ds-3 Maintainer: Debian Python Team Uploaders: Jerome Benoit Homepage: https://graph-tool.skewed.de/ Standards-Version: 4.7.0 Vcs-Browser: https://salsa.debian.org/python-team/packages/graph-tool Vcs-Git: https://salsa.debian.org/python-team/packages/graph-tool.git Testsuite: autopkgtest Testsuite-Triggers: build-essential, gir1.2-gtk-3.0, libboost-dev, libboost-python-dev, libpython3-dev, pkgconf, python3-cairo, python3-cairo-dev, python3-gi, python3-matplotlib Build-Depends: debhelper-compat (= 13), autoconf-archive, dh-python, python3, libgmp-dev, libcgal-dev, libboost-thread-dev, libboost-system-dev, libboost-iostreams-dev, libboost-regex-dev, libboost-coroutine-dev, libboost-graph-dev, libboost-python-dev, libexpat1-dev, libsparsehash-dev, libcairomm-1.0-dev, python3-dev, python3-numpy-dev, python3-cairo-dev, python3-numpy, python3-scipy, python3-matplotlib, zstd, vpx-tools, librsvg2-common, gir1.2-gtk-3.0, python3-gi Build-Depends-Indep: dh-sequence-sphinxdoc, python3-docutils, python3-sphinx, python3-doc, python3-numpydoc, python-scipy-doc, python-mpltoolkits.basemap-doc, python3-cairo-doc, python-ipython-doc, python-pandas-doc, texlive-latex-base, texlive-latex-recommended, texlive-fonts-recommended, texlive-latex-extra, cm-super-minimal, poppler-utils, latexmk Package-List: graph-tool-doc deb doc optional arch=all python3-graph-tool deb python optional arch=amd64,arm64,s390x,ia64,loong64,ppc64,riscv64 Checksums-Sha1: 5d78f78a5f906664a3ab0103ffc90f3d13a50179 14706028 graph-tool_2.77+ds.orig.tar.xz df60305575dc1a10c380393040bde76a465da51c 363472 graph-tool_2.77+ds-3.debian.tar.xz Checksums-Sha256: cbb4dccbca81491d373a3fd6fd5cfafa2004a665da95a61e0ad0ada660df5a77 14706028 graph-tool_2.77+ds.orig.tar.xz d819346791509e5dedf0b71a484a6c0a0d6eec56f5faa39b54030c8bcffc315d 363472 graph-tool_2.77+ds-3.debian.tar.xz Files: 10cd9fe9e3eddab9618586387952b832 14706028 graph-tool_2.77+ds.orig.tar.xz 55c1294eef0fc60543bd921659c1a808 363472 graph-tool_2.77+ds-3.debian.tar.xz -----BEGIN PGP SIGNATURE----- iQEzBAEBCgAdFiEE1Uw7+v+wQt44LaXXQc5/C58bizIFAmdl3iEACgkQQc5/C58b izK5Qwf+MjWeDjxYIIz6WI6NpFLkmfqyQYU74MOBVZzU47UMnHK8h6eHN1e00+eD rFa/Vt8BVNnrfiSb98TuRbMPiLEXmbZTmtJ9Cv/fSfXl4IZM+aQrf/0KrecT6p2n MDWcIoyIoPpH1O/XAXFFDUZta4ZBtyLJU2lWr/KgZtsHoILsNiTzqn96izWIYW9R zlZcdJerLZ8I92PS1a0FN2z0okwyC2V9qGLvqXtDh2QGVXbwHxuRiHqtMHJriL4x qQsEH4j2b8jxGiahUOLWUBRCIahgXHEpzul+6RjirZ81pmbqzU51M2tQj+65ir4c K4woWbYtkU2oaXjuj02Q1G66uT4Y1w== =6IfW -----END PGP SIGNATURE----- Thu Jan 23 01:11:13 UTC 2025 I: Checking whether the package is not for us Thu Jan 23 01:11:13 UTC 2025 I: Starting 1st build on remote node infom02-amd64.debian.net. Thu Jan 23 01:11:13 UTC 2025 I: Preparing to do remote build '1' on infom02-amd64.debian.net. Thu Jan 23 01:11:13 UTC 2025 - checking /var/lib/jenkins/offline_nodes if infom02-amd64.debian.net is marked as down. Thu Jan 23 01:11:13 UTC 2025 - checking via ssh if infom02-amd64.debian.net is up. removed '/tmp/read-only-fs-test-WW7Faf' ==================================================================================== Wed Feb 25 07:34:16 UTC 2026 - running /srv/jenkins/bin/reproducible_build.sh (for job /srv/jenkins/bin/reproducible_build.sh) on infom02-amd64, called using "1 graph-tool unstable /srv/reproducible-results/rbuild-debian/r-b-build.ULgpyCNo 2.77+ds-3" as arguments. Wed Feb 25 07:34:16 UTC 2026 - actually running "reproducible_build.sh" (md5sum 68e686e434c9ab7bc3ec047d8b309cbc) as "/tmp/jenkins-script-1JcE9bfB" $ git clone https://salsa.debian.org/qa/jenkins.debian.net.git ; more CONTRIBUTING Wed Feb 25 07:34:16 UTC 2026 I: Downloading source for unstable/graph-tool=2.77+ds-3 Reading package lists... NOTICE: 'graph-tool' packaging is maintained in the 'Git' version control system at: https://salsa.debian.org/python-team/packages/graph-tool.git Please use: git clone https://salsa.debian.org/python-team/packages/graph-tool.git to retrieve the latest (possibly unreleased) updates to the package. Need to get 15.1 MB of source archives. Get:1 http://deb.debian.org/debian unstable/main graph-tool 2.77+ds-3 (dsc) [2759 B] Get:2 http://deb.debian.org/debian unstable/main graph-tool 2.77+ds-3 (tar) [14.7 MB] Get:3 http://deb.debian.org/debian unstable/main graph-tool 2.77+ds-3 (diff) [363 kB] Fetched 15.1 MB in 0s (65.4 MB/s) Download complete and in download only mode Reading package lists... NOTICE: 'graph-tool' packaging is maintained in the 'Git' version control system at: https://salsa.debian.org/python-team/packages/graph-tool.git Please use: git clone https://salsa.debian.org/python-team/packages/graph-tool.git to retrieve the latest (possibly unreleased) updates to the package. Need to get 15.1 MB of source archives. Get:1 http://deb.debian.org/debian unstable/main graph-tool 2.77+ds-3 (dsc) [2759 B] Get:2 http://deb.debian.org/debian unstable/main graph-tool 2.77+ds-3 (tar) [14.7 MB] Get:3 http://deb.debian.org/debian unstable/main graph-tool 2.77+ds-3 (diff) [363 kB] Fetched 15.1 MB in 0s (65.4 MB/s) Download complete and in download only mode ============================================================================= Building graph-tool in unstable on amd64 on infom02-amd64 now. Date: Wed Feb 25 07:34:16 UTC 2026 Date UTC: Wed Feb 25 07:34:16 UTC 2026 ============================================================================= W: /root/.pbuilderrc does not exist I: Logging to b1/build.log I: pbuilder: network access will be disabled during build I: Current time: Tue Feb 24 19:34:16 -12 2026 I: pbuilder-time-stamp: 1772004856 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/unstable-reproducible-base.tgz] I: copying local configuration W: --override-config is not set; not updating apt.conf Read the manpage for details. I: mounting /proc filesystem I: mounting /sys filesystem I: creating /{dev,run}/shm I: mounting /dev/pts filesystem I: redirecting /dev/ptmx to /dev/pts/ptmx I: policy-rc.d already exists I: Copying source file I: copying [graph-tool_2.77+ds-3.dsc] I: copying [./graph-tool_2.77+ds.orig.tar.xz] I: copying [./graph-tool_2.77+ds-3.debian.tar.xz] I: Extracting source dpkg-source: warning: cannot verify inline signature for ./graph-tool_2.77+ds-3.dsc: unsupported subcommand dpkg-source: info: extracting graph-tool in graph-tool-2.77+ds dpkg-source: info: unpacking graph-tool_2.77+ds.orig.tar.xz dpkg-source: info: unpacking graph-tool_2.77+ds-3.debian.tar.xz dpkg-source: info: using patch list from debian/patches/series dpkg-source: info: applying upstream-workaround-int128-arch-32bits.patch dpkg-source: info: applying upstream-fix-autotools-update.patch dpkg-source: info: applying upstream-sanitise-autotools-git_data-discard.patch dpkg-source: info: applying debianization-documentation.patch dpkg-source: info: applying debianization-documentation-adhoc.patch I: Not using root during the build. I: Installing the build-deps I: user script /srv/workspace/pbuilder/750065/tmp/hooks/D02_print_environment starting I: set BUILDDIR='/build/reproducible-path' BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' BUILDUSERNAME='pbuilder1' BUILD_ARCH='amd64' DEBIAN_FRONTEND='noninteractive' DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=12 ' DISTRIBUTION='unstable' HOME='/root' HOST_ARCH='amd64' IFS=' ' INVOCATION_ID='f239a73c3f8d4f6394163e24c5c5a316' LANG='C' LANGUAGE='en_US:en' LC_ALL='C' MAIL='/var/mail/root' OPTIND='1' PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' PBCURRENTCOMMANDLINEOPERATION='build' PBUILDER_OPERATION='build' PBUILDER_PKGDATADIR='/usr/share/pbuilder' PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' PBUILDER_SYSCONFDIR='/etc' PPID='750065' PS1='# ' PS2='> ' PS4='+ ' PWD='/' SHELL='/bin/bash' SHLVL='2' SUDO_COMMAND='/usr/bin/timeout -k 18.1h 18h /usr/bin/ionice -c 3 /usr/bin/nice /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.ULgpyCNo/pbuilderrc_Oogj --distribution unstable --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.ULgpyCNo/b1 --logfile b1/build.log graph-tool_2.77+ds-3.dsc' SUDO_GID='109' SUDO_UID='104' SUDO_USER='jenkins' TERM='unknown' TZ='/usr/share/zoneinfo/Etc/GMT+12' USER='root' _='/usr/bin/systemd-run' I: uname -a Linux infom02-amd64 6.11.10+bpo-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.11.10-1~bpo12+1 (2024-12-19) x86_64 GNU/Linux I: ls -l /bin lrwxrwxrwx 1 root root 7 Nov 22 2024 /bin -> usr/bin I: user script /srv/workspace/pbuilder/750065/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy Version: 0.invalid.0 Architecture: amd64 Maintainer: Debian Pbuilder Team Description: Dummy package to satisfy dependencies with aptitude - created by pbuilder This package was created automatically by pbuilder to satisfy the build-dependencies of the package being currently built. Depends: debhelper-compat (= 13), autoconf-archive, dh-python, python3, libgmp-dev, libcgal-dev, libboost-thread-dev, libboost-system-dev, libboost-iostreams-dev, libboost-regex-dev, libboost-coroutine-dev, libboost-graph-dev, libboost-python-dev, libexpat1-dev, libsparsehash-dev, libcairomm-1.0-dev, python3-dev, python3-numpy-dev, python3-cairo-dev, python3-numpy, python3-scipy, python3-matplotlib, zstd, vpx-tools, librsvg2-common, gir1.2-gtk-3.0, python3-gi, dh-sequence-sphinxdoc, python3-docutils, python3-sphinx, python3-doc, python3-numpydoc, python-scipy-doc, python-mpltoolkits.basemap-doc, python3-cairo-doc, python-ipython-doc, python-pandas-doc, texlive-latex-base, texlive-latex-recommended, texlive-fonts-recommended, texlive-latex-extra, cm-super-minimal, poppler-utils, latexmk dpkg-deb: building package 'pbuilder-satisfydepends-dummy' in '/tmp/satisfydepends-aptitude/pbuilder-satisfydepends-dummy.deb'. Selecting previously unselected package pbuilder-satisfydepends-dummy. (Reading database ... 19831 files and directories currently installed.) Preparing to unpack .../pbuilder-satisfydepends-dummy.deb ... Unpacking pbuilder-satisfydepends-dummy (0.invalid.0) ... dpkg: pbuilder-satisfydepends-dummy: dependency problems, but configuring anyway as you requested: pbuilder-satisfydepends-dummy depends on debhelper-compat (= 13); however: Package debhelper-compat is not installed. pbuilder-satisfydepends-dummy depends on autoconf-archive; however: Package autoconf-archive is not installed. pbuilder-satisfydepends-dummy depends on dh-python; however: Package dh-python is not installed. pbuilder-satisfydepends-dummy depends on python3; however: Package python3 is not installed. pbuilder-satisfydepends-dummy depends on libgmp-dev; however: Package libgmp-dev is not installed. pbuilder-satisfydepends-dummy depends on libcgal-dev; however: Package libcgal-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-thread-dev; however: Package libboost-thread-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-system-dev; however: Package libboost-system-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-iostreams-dev; however: Package libboost-iostreams-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-regex-dev; however: Package libboost-regex-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-coroutine-dev; however: Package libboost-coroutine-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-graph-dev; however: Package libboost-graph-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-python-dev; however: Package libboost-python-dev is not installed. pbuilder-satisfydepends-dummy depends on libexpat1-dev; however: Package libexpat1-dev is not installed. pbuilder-satisfydepends-dummy depends on libsparsehash-dev; however: Package libsparsehash-dev is not installed. pbuilder-satisfydepends-dummy depends on libcairomm-1.0-dev; however: Package libcairomm-1.0-dev is not installed. pbuilder-satisfydepends-dummy depends on python3-dev; however: Package python3-dev is not installed. pbuilder-satisfydepends-dummy depends on python3-numpy-dev; however: Package python3-numpy-dev is not installed. pbuilder-satisfydepends-dummy depends on python3-cairo-dev; however: Package python3-cairo-dev is not installed. pbuilder-satisfydepends-dummy depends on python3-numpy; however: Package python3-numpy is not installed. pbuilder-satisfydepends-dummy depends on python3-scipy; however: Package python3-scipy is not installed. pbuilder-satisfydepends-dummy depends on python3-matplotlib; however: Package python3-matplotlib is not installed. pbuilder-satisfydepends-dummy depends on zstd; however: Package zstd is not installed. pbuilder-satisfydepends-dummy depends on vpx-tools; however: Package vpx-tools is not installed. pbuilder-satisfydepends-dummy depends on librsvg2-common; however: Package librsvg2-common is not installed. pbuilder-satisfydepends-dummy depends on gir1.2-gtk-3.0; however: Package gir1.2-gtk-3.0 is not installed. pbuilder-satisfydepends-dummy depends on python3-gi; however: Package python3-gi is not installed. pbuilder-satisfydepends-dummy depends on dh-sequence-sphinxdoc; however: Package dh-sequence-sphinxdoc is not installed. pbuilder-satisfydepends-dummy depends on python3-docutils; however: Package python3-docutils is not installed. pbuilder-satisfydepends-dummy depends on python3-sphinx; however: Package python3-sphinx is not installed. pbuilder-satisfydepends-dummy depends on python3-doc; however: Package python3-doc is not installed. pbuilder-satisfydepends-dummy depends on python3-numpydoc; however: Package python3-numpydoc is not installed. pbuilder-satisfydepends-dummy depends on python-scipy-doc; however: Package python-scipy-doc is not installed. pbuilder-satisfydepends-dummy depends on python-mpltoolkits.basemap-doc; however: Package python-mpltoolkits.basemap-doc is not installed. pbuilder-satisfydepends-dummy depends on python3-cairo-doc; however: Package python3-cairo-doc is not installed. pbuilder-satisfydepends-dummy depends on python-ipython-doc; however: Package python-ipython-doc is not installed. pbuilder-satisfydepends-dummy depends on python-pandas-doc; however: Package python-pandas-doc is not installed. pbuilder-satisfydepends-dummy depends on texlive-latex-base; however: Package texlive-latex-base is not installed. pbuilder-satisfydepends-dummy depends on texlive-latex-recommended; however: Package texlive-latex-recommended is not installed. pbuilder-satisfydepends-dummy depends on texlive-fonts-recommended; however: Package texlive-fonts-recommended is not installed. pbuilder-satisfydepends-dummy depends on texlive-latex-extra; however: Package texlive-latex-extra is not installed. pbuilder-satisfydepends-dummy depends on cm-super-minimal; however: Package cm-super-minimal is not installed. pbuilder-satisfydepends-dummy depends on poppler-utils; however: Package poppler-utils is not installed. pbuilder-satisfydepends-dummy depends on latexmk; however: Package latexmk is not installed. Setting up pbuilder-satisfydepends-dummy (0.invalid.0) ... Reading package lists... Building dependency tree... Reading state information... Initializing package states... Writing extended state information... Building tag database... pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) The following NEW packages will be installed: adwaita-icon-theme{a} at-spi2-common{a} autoconf{a} autoconf-archive{a} automake{a} autopoint{a} autotools-dev{a} blt{a} bsdextrautils{a} ca-certificates{a} cm-super-minimal{a} dbus{a} dbus-bin{a} dbus-daemon{a} dbus-session-bus-common{a} dbus-system-bus-common{a} dbus-user-session{a} dconf-gsettings-backend{a} dconf-service{a} debhelper{a} dh-autoreconf{a} dh-python{a} dh-strip-nondeterminism{a} dirmngr{a} docutils-common{a} dwz{a} file{a} fontconfig{a} fontconfig-config{a} fonts-dejavu-core{a} fonts-dejavu-mono{a} fonts-font-awesome{a} fonts-lato{a} fonts-lmodern{a} fonts-lyx{a} fonts-mathjax{a} fonts-open-sans{a} gettext{a} gettext-base{a} gir1.2-atk-1.0{a} gir1.2-freedesktop{a} gir1.2-gdkpixbuf-2.0{a} gir1.2-girepository-2.0{a} gir1.2-glib-2.0{a} gir1.2-gtk-3.0{a} gir1.2-harfbuzz-0.0{a} gir1.2-pango-1.0{a} girepository-tools{a} gnupg{a} gnupg-l10n{a} gpg{a} gpg-agent{a} gpgconf{a} gpgsm{a} groff-base{a} gtk-update-icon-cache{a} hicolor-icon-theme{a} icu-devtools{a} intltool-debian{a} latexmk{a} libapache-pom-java{a} libapparmor1{a} libarchive-zip-perl{a} libassuan9{a} libatk-bridge2.0-0t64{a} libatk1.0-0t64{a} libatspi2.0-0t64{a} libavahi-client3{a} libavahi-common-data{a} libavahi-common3{a} libblas3{a} libblkid-dev{a} libboost-atomic1.83-dev{a} libboost-atomic1.83.0{a} libboost-chrono1.83-dev{a} libboost-chrono1.83.0t64{a} libboost-context1.83-dev{a} libboost-context1.83.0{a} libboost-coroutine-dev{a} libboost-coroutine1.83-dev{a} libboost-coroutine1.83.0{a} libboost-date-time1.83-dev{a} libboost-date-time1.83.0{a} libboost-dev{a} libboost-graph-dev{a} libboost-graph1.83-dev{a} libboost-graph1.83.0{a} libboost-iostreams-dev{a} libboost-iostreams1.83-dev{a} libboost-program-options-dev{a} libboost-program-options1.83-dev{a} libboost-program-options1.83.0{a} libboost-python-dev{a} libboost-python1.83-dev{a} libboost-python1.83.0{a} libboost-regex-dev{a} libboost-regex1.83-dev{a} libboost-regex1.83.0{a} libboost-serialization1.83-dev{a} libboost-serialization1.83.0{a} libboost-system-dev{a} libboost-system1.83-dev{a} libboost-system1.83.0{a} libboost-test1.83-dev{a} libboost-test1.83.0{a} libboost-thread-dev{a} libboost-thread1.83-dev{a} libboost-thread1.83.0{a} libboost1.83-dev{a} libbrotli-dev{a} libbrotli1{a} libbz2-dev{a} libcairo-gobject2{a} libcairo-script-interpreter2{a} libcairo2{a} libcairo2-dev{a} libcairomm-1.0-1v5{a} libcairomm-1.0-dev{a} libcgal-dev{a} libcloudproviders0{a} libcolord2{a} libcom-err2{a} libcommons-logging-java{a} libcommons-parent-java{a} libcups2t64{a} libcurl3t64-gnutls{a} libdatrie1{a} libdav1d7{a} libdbus-1-3{a} libdconf1{a} libdebhelper-perl{a} libdeflate0{a} libelf1t64{a} libepoxy0{a} libexpat1{a} libexpat1-dev{a} libffi-dev{a} libffi8{a} libfile-stripnondeterminism-perl{a} libfontbox-java{a} libfontconfig-dev{a} libfontconfig1{a} libfreetype-dev{a} libfreetype6{a} libfribidi0{a} libgcrypt20{a} libgdk-pixbuf-2.0-0{a} libgdk-pixbuf2.0-common{a} libgfortran5{a} libgio-2.0-dev{a} libgio-2.0-dev-bin{a} libgirepository-1.0-1{a} libgirepository-2.0-0{a} libglib2.0-0t64{a} libglib2.0-bin{a} libglib2.0-data{a} libglib2.0-dev{a} libglib2.0-dev-bin{a} libgmp-dev{a} libgmpxx4ldbl{a} libgnutls30t64{a} libgpg-error0{a} libgpgme11t64{a} libgpgmepp6t64{a} libgraphite2-3{a} libgssapi-krb5-2{a} libgtk-3-0t64{a} libgtk-3-common{a} libharfbuzz-gobject0{a} libharfbuzz0b{a} libice-dev{a} libice6{a} libicu-dev{a} libicu72{a} libidn2-0{a} libimagequant0{a} libjbig0{a} libjpeg62-turbo{a} libjs-jquery{a} libjs-jquery-ui{a} libjs-mathjax{a} libjs-sphinxdoc{a} libjs-underscore{a} libjson-perl{a} libk5crypto3{a} libkeyutils1{a} libkpathsea6{a} libkrb5-3{a} libkrb5support0{a} libksba8{a} liblapack3{a} liblbfgsb0{a} liblcms2-2{a} libldap2{a} liblerc4{a} liblzo2-2{a} libmagic-mgc{a} libmagic1t64{a} libmount-dev{a} libmpfi0{a} libmpfr-dev{a} libnghttp2-14{a} libnghttp3-9{a} libngtcp2-16{a} libngtcp2-crypto-gnutls8{a} libnpth0t64{a} libnspr4{a} libnss3{a} libopenjp2-7{a} libp11-kit0{a} libpam-systemd{a} libpango-1.0-0{a} libpangocairo-1.0-0{a} libpangoft2-1.0-0{a} libpangoxft-1.0-0{a} libpaper-utils{a} libpaper2{a} libpcre2-16-0{a} libpcre2-32-0{a} libpcre2-dev{a} libpcre2-posix3{a} libpdfbox-java{a} libpipeline1{a} libpixman-1-0{a} libpixman-1-dev{a} libpkgconf3{a} libpng-dev{a} libpng16-16t64{a} libpoppler140{a} libpotrace0{a} libproc2-0{a} libpsl5t64{a} libptexenc1{a} libpython3-dev{a} libpython3-stdlib{a} libpython3.13{a} libpython3.13-dev{a} libpython3.13-minimal{a} libpython3.13-stdlib{a} libqhull-r8.0{a} libraqm0{a} libreadline8t64{a} librsvg2-2{a} librsvg2-common{a} librtmp1{a} libsasl2-2{a} libsasl2-modules-db{a} libselinux1-dev{a} libsepol-dev{a} libsharpyuv0{a} libsigc++-2.0-dev{a} libsm-dev{a} libsm6{a} libsparsehash-dev{a} libssh2-1t64{a} libsynctex2{a} libsysprof-capture-4-dev{a} libsystemd-shared{a} libtasn1-6{a} libtcl8.6{a} libteckit0{a} libtexlua53-5{a} libtext-charwidth-perl{a} libtext-wrapi18n-perl{a} libthai-data{a} libthai0{a} libtiff6{a} libtk8.6{a} libtool{a} libuchardet0{a} libunistring5{a} libvpx9{a} libwayland-client0{a} libwayland-cursor0{a} libwayland-egl1{a} libwebp7{a} libwebpdemux2{a} libwebpmux3{a} libx11-6{a} libx11-data{a} libx11-dev{a} libxau-dev{a} libxau6{a} libxaw7{a} libxcb-render0{a} libxcb-render0-dev{a} libxcb-shm0{a} libxcb-shm0-dev{a} libxcb1{a} libxcb1-dev{a} libxcomposite1{a} libxcursor1{a} libxdamage1{a} libxdmcp-dev{a} libxdmcp6{a} libxext-dev{a} libxext6{a} libxfixes3{a} libxft2{a} libxi6{a} libxinerama1{a} libxkbcommon0{a} libxml2{a} libxmu6{a} libxpm4{a} libxrandr2{a} libxrender-dev{a} libxrender1{a} libxslt1.1{a} libxss1{a} libxt6t64{a} libzzip-0-13t64{a} m4{a} man-db{a} media-types{a} native-architecture{a} netbase{a} openssl{a} pinentry-curses{a} pkgconf{a} pkgconf-bin{a} po-debconf{a} poppler-utils{a} preview-latex-style{a} procps{a} python-babel-localedata{a} python-ipython-doc{a} python-matplotlib-data{a} python-mpltoolkits.basemap-doc{a} python-pandas-doc{a} python-scipy-doc{a} python3{a} python3-alabaster{a} python3-attr{a} python3-autocommand{a} python3-babel{a} python3-brotli{a} python3-cairo{a} python3-cairo-dev{a} python3-cairo-doc{a} python3-certifi{a} python3-chardet{a} python3-charset-normalizer{a} python3-contourpy{a} python3-cycler{a} python3-dateutil{a} python3-decorator{a} python3-defusedxml{a} python3-dev{a} python3-doc{a} python3-docutils{a} python3-fonttools{a} python3-fs{a} python3-gi{a} python3-idna{a} python3-imagesize{a} python3-inflect{a} python3-jaraco.context{a} python3-jaraco.functools{a} python3-jaraco.text{a} python3-jinja2{a} python3-kiwisolver{a} python3-lxml{a} python3-lz4{a} python3-markupsafe{a} python3-matplotlib{a} python3-minimal{a} python3-more-itertools{a} python3-mpmath{a} python3-numpy{a} python3-numpydoc{a} python3-packaging{a} python3-pil{a} python3-pil.imagetk{a} python3-pkg-resources{a} python3-platformdirs{a} python3-pygments{a} python3-pyparsing{a} python3-requests{a} python3-roman{a} python3-scipy{a} python3-setuptools{a} python3-snowballstemmer{a} python3-sphinx{a} python3-sympy{a} python3-tabulate{a} python3-tk{a} python3-typeguard{a} python3-typing-extensions{a} python3-tz{a} python3-ufolib2{a} python3-unicodedata2{a} python3-urllib3{a} python3-zipp{a} python3.12-tk{a} python3.13{a} python3.13-dev{a} python3.13-doc{a} python3.13-minimal{a} python3.13-tk{a} readline-common{a} sensible-utils{a} sgml-base{a} shared-mime-info{a} sphinx-common{a} sphinx-rtd-theme-common{a} systemd{a} systemd-sysv{a} t1utils{a} tex-common{a} texlive-base{a} texlive-binaries{a} texlive-fonts-recommended{a} texlive-latex-base{a} texlive-latex-extra{a} texlive-latex-recommended{a} texlive-pictures{a} tk8.6-blt2.5{a} tzdata{a} ucf{a} unicode-data{a} uuid-dev{a} vpx-tools{a} x11-common{a} x11proto-core-dev{a} x11proto-dev{a} xdg-utils{a} xkb-data{a} xml-core{a} xorg-sgml-doctools{a} xtrans-dev{a} zlib1g-dev{a} zstd{a} The following packages are RECOMMENDED but will NOT be installed: apvlv at-spi2-core atril bzip2-doc chrony curl default-jre dvisvgm evince ghostscript gnupg-utils gpg-wks-client gpgv gpgv-from-sq gv isympy-common javascript-common krb5-locales libarchive-cpio-perl libfile-mimeinfo-perl libgdk-pixbuf2.0-bin libgpg-error-l10n libgtk-3-bin libjson-xs-perl libkmod2 libldap-common libltdl-dev libmail-sendmail-perl libnet-dbus-perl libnss-systemd libpng-tools libsasl2-modules libspreadsheet-parseexcel-perl libx11-protocol-perl linux-sysctl-defaults lmodern lynx mupdf ntpsec okular openntpd poppler-data psmisc publicsuffix python3-bs4 python3-cssselect python3-html5lib python3-olefile python3-pooch qpdfview qpdfview-ps-plugin ruby systemd-cryptsetup systemd-timesyncd tex-gyre texlive-plain-generic tipa tk viewpdf.app wget x11-utils x11-xserver-utils xdg-user-dirs xpdf zathura-pdf-poppler zathura-ps 0 packages upgraded, 433 newly installed, 0 to remove and 0 not upgraded. Need to get 407 MB of archives. After unpacking 1973 MB will be used. Writing extended state information... Get: 1 http://deb.debian.org/debian unstable/main amd64 libsystemd-shared amd64 257.2-2 [2138 kB] Get: 2 http://deb.debian.org/debian unstable/main amd64 libapparmor1 amd64 3.1.7-1+b3 [42.1 kB] Get: 3 http://deb.debian.org/debian unstable/main amd64 systemd amd64 257.2-2 [3092 kB] Get: 4 http://deb.debian.org/debian unstable/main amd64 systemd-sysv amd64 257.2-2 [60.8 kB] Get: 5 http://deb.debian.org/debian unstable/main amd64 libdbus-1-3 amd64 1.16.0-1 [177 kB] Get: 6 http://deb.debian.org/debian unstable/main amd64 dbus-bin amd64 1.16.0-1 [78.9 kB] Get: 7 http://deb.debian.org/debian unstable/main amd64 dbus-session-bus-common all 1.16.0-1 [51.1 kB] Get: 8 http://deb.debian.org/debian unstable/main amd64 libexpat1 amd64 2.6.4-1 [106 kB] Get: 9 http://deb.debian.org/debian unstable/main amd64 dbus-daemon amd64 1.16.0-1 [157 kB] Get: 10 http://deb.debian.org/debian unstable/main amd64 dbus-system-bus-common all 1.16.0-1 [52.2 kB] Get: 11 http://deb.debian.org/debian unstable/main amd64 dbus amd64 1.16.0-1 [70.5 kB] Get: 12 http://deb.debian.org/debian unstable/main amd64 autoconf-archive all 20220903-3 [775 kB] Get: 13 http://deb.debian.org/debian unstable/main amd64 fonts-lato all 2.015-1 [2780 kB] Get: 14 http://deb.debian.org/debian unstable/main amd64 libpython3.13-minimal amd64 3.13.1-3 [858 kB] Get: 15 http://deb.debian.org/debian unstable/main amd64 python3.13-minimal amd64 3.13.1-3 [2202 kB] Get: 16 http://deb.debian.org/debian unstable/main amd64 python3-minimal amd64 3.13.1-2 [27.0 kB] Get: 17 http://deb.debian.org/debian unstable/main amd64 media-types all 10.1.0 [26.9 kB] Get: 18 http://deb.debian.org/debian unstable/main amd64 netbase all 6.4 [12.8 kB] Get: 19 http://deb.debian.org/debian unstable/main amd64 tzdata all 2025a-1 [259 kB] Get: 20 http://deb.debian.org/debian unstable/main amd64 libffi8 amd64 3.4.6-1 [23.6 kB] Get: 21 http://deb.debian.org/debian unstable/main amd64 readline-common all 8.2-6 [69.4 kB] Get: 22 http://deb.debian.org/debian unstable/main amd64 libreadline8t64 amd64 8.2-6 [169 kB] Get: 23 http://deb.debian.org/debian unstable/main amd64 libpython3.13-stdlib amd64 3.13.1-3 [1973 kB] Get: 24 http://deb.debian.org/debian unstable/main amd64 python3.13 amd64 3.13.1-3 [740 kB] Get: 25 http://deb.debian.org/debian unstable/main amd64 libpython3-stdlib amd64 3.13.1-2 [9952 B] Get: 26 http://deb.debian.org/debian unstable/main amd64 python3 amd64 3.13.1-2 [28.0 kB] Get: 27 http://deb.debian.org/debian unstable/main amd64 sgml-base all 1.31 [15.4 kB] Get: 28 http://deb.debian.org/debian unstable/main amd64 libproc2-0 amd64 2:4.0.4-6 [64.8 kB] Get: 29 http://deb.debian.org/debian unstable/main amd64 procps amd64 2:4.0.4-6 [879 kB] Get: 30 http://deb.debian.org/debian unstable/main amd64 sensible-utils all 0.0.24 [24.8 kB] Get: 31 http://deb.debian.org/debian unstable/main amd64 openssl amd64 3.4.0-2 [1422 kB] Get: 32 http://deb.debian.org/debian unstable/main amd64 ca-certificates all 20241223 [164 kB] Get: 33 http://deb.debian.org/debian unstable/main amd64 libmagic-mgc amd64 1:5.45-3+b1 [314 kB] Get: 34 http://deb.debian.org/debian unstable/main amd64 libmagic1t64 amd64 1:5.45-3+b1 [108 kB] Get: 35 http://deb.debian.org/debian unstable/main amd64 file amd64 1:5.45-3+b1 [43.3 kB] Get: 36 http://deb.debian.org/debian unstable/main amd64 gettext-base amd64 0.23.1-1 [243 kB] Get: 37 http://deb.debian.org/debian unstable/main amd64 libuchardet0 amd64 0.0.8-1+b2 [68.9 kB] Get: 38 http://deb.debian.org/debian unstable/main amd64 groff-base amd64 1.23.0-7 [1185 kB] Get: 39 http://deb.debian.org/debian unstable/main amd64 libpam-systemd amd64 257.2-2 [293 kB] Get: 40 http://deb.debian.org/debian unstable/main amd64 bsdextrautils amd64 2.40.4-1 [92.2 kB] Get: 41 http://deb.debian.org/debian unstable/main amd64 libpipeline1 amd64 1.5.8-1 [42.0 kB] Get: 42 http://deb.debian.org/debian unstable/main amd64 man-db amd64 2.13.0-1 [1420 kB] Get: 43 http://deb.debian.org/debian unstable/main amd64 libtext-charwidth-perl amd64 0.04-11+b4 [9476 B] Get: 44 http://deb.debian.org/debian unstable/main amd64 libtext-wrapi18n-perl all 0.06-10 [8808 B] Get: 45 http://deb.debian.org/debian unstable/main amd64 ucf all 3.0048 [42.0 kB] Get: 46 http://deb.debian.org/debian unstable/main amd64 libgdk-pixbuf2.0-common all 2.42.12+dfsg-2 [311 kB] Get: 47 http://deb.debian.org/debian unstable/main amd64 libglib2.0-0t64 amd64 2.82.4-2 [1502 kB] Get: 48 http://deb.debian.org/debian unstable/main amd64 libicu72 amd64 72.1-6 [9421 kB] Get: 49 http://deb.debian.org/debian unstable/main amd64 libxml2 amd64 2.12.7+dfsg+really2.9.14-0.2+b1 [699 kB] Get: 50 http://deb.debian.org/debian unstable/main amd64 shared-mime-info amd64 2.4-5+b1 [759 kB] Get: 51 http://deb.debian.org/debian unstable/main amd64 libjpeg62-turbo amd64 1:2.1.5-3+b1 [168 kB] Get: 52 http://deb.debian.org/debian unstable/main amd64 libpng16-16t64 amd64 1.6.45-1 [281 kB] Get: 53 http://deb.debian.org/debian unstable/main amd64 libdeflate0 amd64 1.23-1+b1 [47.5 kB] Get: 54 http://deb.debian.org/debian unstable/main amd64 libjbig0 amd64 2.1-6.1+b2 [32.1 kB] Get: 55 http://deb.debian.org/debian unstable/main amd64 liblerc4 amd64 4.0.0+ds-5 [183 kB] Get: 56 http://deb.debian.org/debian unstable/main amd64 libsharpyuv0 amd64 1.5.0-0.1 [116 kB] Get: 57 http://deb.debian.org/debian unstable/main amd64 libwebp7 amd64 1.5.0-0.1 [318 kB] Get: 58 http://deb.debian.org/debian unstable/main amd64 libtiff6 amd64 4.5.1+git230720-5 [324 kB] Get: 59 http://deb.debian.org/debian unstable/main amd64 libgdk-pixbuf-2.0-0 amd64 2.42.12+dfsg-2 [140 kB] Get: 60 http://deb.debian.org/debian unstable/main amd64 gtk-update-icon-cache amd64 4.16.12+ds-1 [50.6 kB] Get: 61 http://deb.debian.org/debian unstable/main amd64 hicolor-icon-theme all 0.18-2 [11.8 kB] Get: 62 http://deb.debian.org/debian unstable/main amd64 adwaita-icon-theme all 47.0-2 [463 kB] Get: 63 http://deb.debian.org/debian unstable/main amd64 at-spi2-common all 2.55.0.1-1 [170 kB] Get: 64 http://deb.debian.org/debian unstable/main amd64 m4 amd64 1.4.19-5 [294 kB] Get: 65 http://deb.debian.org/debian unstable/main amd64 autoconf all 2.72-3 [493 kB] Get: 66 http://deb.debian.org/debian unstable/main amd64 autotools-dev all 20220109.1 [51.6 kB] Get: 67 http://deb.debian.org/debian unstable/main amd64 automake all 1:1.16.5-1.3 [823 kB] Get: 68 http://deb.debian.org/debian unstable/main amd64 autopoint all 0.23.1-1 [770 kB] Get: 69 http://deb.debian.org/debian unstable/main amd64 libtcl8.6 amd64 8.6.16+dfsg-1 [1042 kB] Get: 70 http://deb.debian.org/debian unstable/main amd64 libbrotli1 amd64 1.1.0-2+b6 [302 kB] Get: 71 http://deb.debian.org/debian unstable/main amd64 libfreetype6 amd64 2.13.3+dfsg-1 [452 kB] Get: 72 http://deb.debian.org/debian unstable/main amd64 fonts-dejavu-mono all 2.37-8 [489 kB] Get: 73 http://deb.debian.org/debian unstable/main amd64 fonts-dejavu-core all 2.37-8 [840 kB] Get: 74 http://deb.debian.org/debian unstable/main amd64 fontconfig-config amd64 2.15.0-2 [317 kB] Get: 75 http://deb.debian.org/debian unstable/main amd64 libfontconfig1 amd64 2.15.0-2 [391 kB] Get: 76 http://deb.debian.org/debian unstable/main amd64 libxau6 amd64 1:1.0.11-1 [20.4 kB] Get: 77 http://deb.debian.org/debian unstable/main amd64 libxdmcp6 amd64 1:1.1.5-1 [27.8 kB] Get: 78 http://deb.debian.org/debian unstable/main amd64 libxcb1 amd64 1.17.0-2+b1 [144 kB] Get: 79 http://deb.debian.org/debian unstable/main amd64 libx11-data all 2:1.8.10-2 [337 kB] Get: 80 http://deb.debian.org/debian unstable/main amd64 libx11-6 amd64 2:1.8.10-2 [813 kB] Get: 81 http://deb.debian.org/debian unstable/main amd64 libxrender1 amd64 1:0.9.10-1.1+b3 [27.8 kB] Get: 82 http://deb.debian.org/debian unstable/main amd64 libxft2 amd64 2.3.6-1+b3 [54.6 kB] Get: 83 http://deb.debian.org/debian unstable/main amd64 libxext6 amd64 2:1.3.4-1+b3 [50.4 kB] Get: 84 http://deb.debian.org/debian unstable/main amd64 x11-common all 1:7.7+23.2 [216 kB] Get: 85 http://deb.debian.org/debian unstable/main amd64 libxss1 amd64 1:1.2.3-1+b3 [17.0 kB] Get: 86 http://deb.debian.org/debian unstable/main amd64 libtk8.6 amd64 8.6.16-1 [793 kB] Get: 87 http://deb.debian.org/debian unstable/main amd64 tk8.6-blt2.5 amd64 2.5.3+dfsg-7 [586 kB] Get: 88 http://deb.debian.org/debian unstable/main amd64 blt amd64 2.5.3+dfsg-7 [6024 B] Get: 89 http://deb.debian.org/debian unstable/main amd64 tex-common all 6.18 [32.5 kB] Get: 90 http://deb.debian.org/debian unstable/main amd64 libpaper2 amd64 2.2.5-0.3 [16.3 kB] Get: 91 http://deb.debian.org/debian unstable/main amd64 libpaper-utils amd64 2.2.5-0.3 [16.1 kB] Get: 92 http://deb.debian.org/debian unstable/main amd64 libkpathsea6 amd64 2024.20240313.70630+ds-5+b1 [157 kB] Get: 93 http://deb.debian.org/debian unstable/main amd64 libptexenc1 amd64 2024.20240313.70630+ds-5+b1 [49.4 kB] Get: 94 http://deb.debian.org/debian unstable/main amd64 libsynctex2 amd64 2024.20240313.70630+ds-5+b1 [63.0 kB] Get: 95 http://deb.debian.org/debian unstable/main amd64 libtexlua53-5 amd64 2024.20240313.70630+ds-5+b1 [115 kB] Get: 96 http://deb.debian.org/debian unstable/main amd64 t1utils amd64 1.41-4 [62.1 kB] Get: 97 http://deb.debian.org/debian unstable/main amd64 libpixman-1-0 amd64 0.44.0-3 [248 kB] Get: 98 http://deb.debian.org/debian unstable/main amd64 libxcb-render0 amd64 1.17.0-2+b1 [115 kB] Get: 99 http://deb.debian.org/debian unstable/main amd64 libxcb-shm0 amd64 1.17.0-2+b1 [105 kB] Get: 100 http://deb.debian.org/debian unstable/main amd64 libcairo2 amd64 1.18.2-2 [535 kB] Get: 101 http://deb.debian.org/debian unstable/main amd64 libgraphite2-3 amd64 1.3.14-2+b1 [75.4 kB] Get: 102 http://deb.debian.org/debian unstable/main amd64 libharfbuzz0b amd64 10.2.0-1 [479 kB] Get: 103 http://deb.debian.org/debian unstable/main amd64 libmpfi0 amd64 1.5.4+ds-4 [35.5 kB] Get: 104 http://deb.debian.org/debian unstable/main amd64 libpotrace0 amd64 1.16-2+b2 [25.6 kB] Get: 105 http://deb.debian.org/debian unstable/main amd64 libteckit0 amd64 2.5.12+ds1-1+b1 [341 kB] Get: 106 http://deb.debian.org/debian unstable/main amd64 libice6 amd64 2:1.1.1-1 [65.4 kB] Get: 107 http://deb.debian.org/debian unstable/main amd64 libsm6 amd64 2:1.2.4-1 [35.2 kB] Get: 108 http://deb.debian.org/debian unstable/main amd64 libxt6t64 amd64 1:1.2.1-1.2+b2 [188 kB] Get: 109 http://deb.debian.org/debian unstable/main amd64 libxmu6 amd64 2:1.1.3-3+b4 [59.0 kB] Get: 110 http://deb.debian.org/debian unstable/main amd64 libxpm4 amd64 1:3.5.17-1+b3 [56.2 kB] Get: 111 http://deb.debian.org/debian unstable/main amd64 libxaw7 amd64 2:1.0.16-1 [212 kB] Get: 112 http://deb.debian.org/debian unstable/main amd64 libxi6 amd64 2:1.8.2-1 [78.9 kB] Get: 113 http://deb.debian.org/debian unstable/main amd64 libzzip-0-13t64 amd64 0.13.72+dfsg.1-1.3 [56.2 kB] Get: 114 http://deb.debian.org/debian unstable/main amd64 texlive-binaries amd64 2024.20240313.70630+ds-5+b1 [8504 kB] Get: 115 http://deb.debian.org/debian unstable/main amd64 xdg-utils all 1.2.1-2 [75.8 kB] Get: 116 http://deb.debian.org/debian unstable/main amd64 texlive-base all 2024.20250114-1 [22.8 MB] Get: 117 http://deb.debian.org/debian unstable/main amd64 fonts-lmodern all 2.005-1 [4540 kB] Get: 118 http://deb.debian.org/debian unstable/main amd64 texlive-latex-base all 2024.20250114-1 [1282 kB] Get: 119 http://deb.debian.org/debian unstable/main amd64 texlive-latex-recommended all 2024.20250114-1 [8760 kB] Get: 120 http://deb.debian.org/debian unstable/main amd64 cm-super-minimal all 0.3.4-17 [5815 kB] Get: 121 http://deb.debian.org/debian unstable/main amd64 dbus-user-session amd64 1.16.0-1 [51.0 kB] Get: 122 http://deb.debian.org/debian unstable/main amd64 libdconf1 amd64 0.40.0-5 [41.8 kB] Get: 123 http://deb.debian.org/debian unstable/main amd64 dconf-service amd64 0.40.0-5 [32.4 kB] Get: 124 http://deb.debian.org/debian unstable/main amd64 dconf-gsettings-backend amd64 0.40.0-5 [28.6 kB] Get: 125 http://deb.debian.org/debian unstable/main amd64 libdebhelper-perl all 13.24.1 [90.9 kB] Get: 126 http://deb.debian.org/debian unstable/main amd64 libtool all 2.5.4-2 [539 kB] Get: 127 http://deb.debian.org/debian unstable/main amd64 dh-autoreconf all 20 [17.1 kB] Get: 128 http://deb.debian.org/debian unstable/main amd64 libarchive-zip-perl all 1.68-1 [104 kB] Get: 129 http://deb.debian.org/debian unstable/main amd64 libfile-stripnondeterminism-perl all 1.14.1-1 [19.6 kB] Get: 130 http://deb.debian.org/debian unstable/main amd64 dh-strip-nondeterminism all 1.14.1-1 [8584 B] Get: 131 http://deb.debian.org/debian unstable/main amd64 libelf1t64 amd64 0.192-4 [189 kB] Get: 132 http://deb.debian.org/debian unstable/main amd64 dwz amd64 0.15-1+b1 [110 kB] Get: 133 http://deb.debian.org/debian unstable/main amd64 libunistring5 amd64 1.3-1 [476 kB] Get: 134 http://deb.debian.org/debian unstable/main amd64 gettext amd64 0.23.1-1 [1680 kB] Get: 135 http://deb.debian.org/debian unstable/main amd64 intltool-debian all 0.35.0+20060710.6 [22.9 kB] Get: 136 http://deb.debian.org/debian unstable/main amd64 po-debconf all 1.0.21+nmu1 [248 kB] Get: 137 http://deb.debian.org/debian unstable/main amd64 debhelper all 13.24.1 [920 kB] Get: 138 http://deb.debian.org/debian unstable/main amd64 python3-autocommand all 2.2.2-3 [13.6 kB] Get: 139 http://deb.debian.org/debian unstable/main amd64 python3-more-itertools all 10.6.0-1 [65.3 kB] Get: 140 http://deb.debian.org/debian unstable/main amd64 python3-typing-extensions all 4.12.2-2 [73.0 kB] Get: 141 http://deb.debian.org/debian unstable/main amd64 python3-typeguard all 4.4.1-1 [37.0 kB] Get: 142 http://deb.debian.org/debian unstable/main amd64 python3-inflect all 7.3.1-2 [32.4 kB] Get: 143 http://deb.debian.org/debian unstable/main amd64 python3-jaraco.context all 6.0.0-1 [7984 B] Get: 144 http://deb.debian.org/debian unstable/main amd64 python3-jaraco.functools all 4.1.0-1 [12.0 kB] Get: 145 http://deb.debian.org/debian unstable/main amd64 python3-pkg-resources all 75.6.0-1 [222 kB] Get: 146 http://deb.debian.org/debian unstable/main amd64 python3-jaraco.text all 4.0.0-1 [11.4 kB] Get: 147 http://deb.debian.org/debian unstable/main amd64 python3-zipp all 3.21.0-1 [10.6 kB] Get: 148 http://deb.debian.org/debian unstable/main amd64 python3-setuptools all 75.6.0-1 [720 kB] Get: 149 http://deb.debian.org/debian unstable/main amd64 dh-python all 6.20250108 [113 kB] Get: 150 http://deb.debian.org/debian unstable/main amd64 libgpg-error0 amd64 1.51-3 [82.2 kB] Get: 151 http://deb.debian.org/debian unstable/main amd64 libassuan9 amd64 3.0.1-2 [60.6 kB] Get: 152 http://deb.debian.org/debian unstable/main amd64 libgcrypt20 amd64 1.11.0-7 [843 kB] Get: 153 http://deb.debian.org/debian unstable/main amd64 gpgconf amd64 2.2.46-1+b1 [121 kB] Get: 154 http://deb.debian.org/debian unstable/main amd64 libidn2-0 amd64 2.3.7-2+b1 [129 kB] Get: 155 http://deb.debian.org/debian unstable/main amd64 libp11-kit0 amd64 0.25.5-3 [425 kB] Get: 156 http://deb.debian.org/debian unstable/main amd64 libtasn1-6 amd64 4.19.0-3+b3 [49.5 kB] Get: 157 http://deb.debian.org/debian unstable/main amd64 libgnutls30t64 amd64 3.8.8-2 [1454 kB] Get: 158 http://deb.debian.org/debian unstable/main amd64 libksba8 amd64 1.6.7-2+b1 [136 kB] Get: 159 http://deb.debian.org/debian unstable/main amd64 libsasl2-modules-db amd64 2.1.28+dfsg1-8+b1 [19.9 kB] Get: 160 http://deb.debian.org/debian unstable/main amd64 libsasl2-2 amd64 2.1.28+dfsg1-8+b1 [57.6 kB] Get: 161 http://deb.debian.org/debian unstable/main amd64 libldap2 amd64 2.6.9+dfsg-1 [192 kB] Get: 162 http://deb.debian.org/debian unstable/main amd64 libnpth0t64 amd64 1.8-2 [22.9 kB] Get: 163 http://deb.debian.org/debian unstable/main amd64 dirmngr amd64 2.2.46-1+b1 [369 kB] Get: 164 http://deb.debian.org/debian unstable/main amd64 xml-core all 0.19 [20.1 kB] Get: 165 http://deb.debian.org/debian unstable/main amd64 docutils-common all 0.21.2+dfsg-2 [128 kB] Get: 166 http://deb.debian.org/debian unstable/main amd64 fontconfig amd64 2.15.0-2 [463 kB] Get: 167 http://deb.debian.org/debian unstable/main amd64 fonts-font-awesome all 5.0.10+really4.7.0~dfsg-4.1 [517 kB] Get: 168 http://deb.debian.org/debian unstable/main amd64 fonts-lyx all 2.4.3-1 [190 kB] Get: 169 http://deb.debian.org/debian unstable/main amd64 fonts-mathjax all 2.7.9+dfsg-1 [2210 kB] Get: 170 http://deb.debian.org/debian unstable/main amd64 fonts-open-sans all 1.11-2 [574 kB] Get: 171 http://deb.debian.org/debian unstable/main amd64 gir1.2-glib-2.0 amd64 2.82.4-2 [194 kB] Get: 172 http://deb.debian.org/debian unstable/main amd64 libatk1.0-0t64 amd64 2.55.0.1-1 [51.5 kB] Get: 173 http://deb.debian.org/debian unstable/main amd64 gir1.2-atk-1.0 amd64 2.55.0.1-1 [25.6 kB] Get: 174 http://deb.debian.org/debian unstable/main amd64 libcairo-gobject2 amd64 1.18.2-2 [130 kB] Get: 175 http://deb.debian.org/debian unstable/main amd64 gir1.2-freedesktop amd64 1.82.0-4 [60.2 kB] Get: 176 http://deb.debian.org/debian unstable/main amd64 gir1.2-gdkpixbuf-2.0 amd64 2.42.12+dfsg-2 [14.2 kB] Get: 177 http://deb.debian.org/debian unstable/main amd64 libgirepository-1.0-1 amd64 1.82.0-4 [115 kB] Get: 178 http://deb.debian.org/debian unstable/main amd64 gir1.2-girepository-2.0 amd64 1.82.0-4 [39.4 kB] Get: 179 http://deb.debian.org/debian unstable/main amd64 libharfbuzz-gobject0 amd64 10.2.0-1 [32.8 kB] Get: 180 http://deb.debian.org/debian unstable/main amd64 gir1.2-harfbuzz-0.0 amd64 10.2.0-1 [42.1 kB] Get: 181 http://deb.debian.org/debian unstable/main amd64 libfribidi0 amd64 1.0.16-1 [26.5 kB] Get: 182 http://deb.debian.org/debian unstable/main amd64 libthai-data all 0.1.29-2 [168 kB] Get: 183 http://deb.debian.org/debian unstable/main amd64 libdatrie1 amd64 0.2.13-3+b1 [38.1 kB] Get: 184 http://deb.debian.org/debian unstable/main amd64 libthai0 amd64 0.1.29-2+b1 [49.4 kB] Get: 185 http://deb.debian.org/debian unstable/main amd64 libpango-1.0-0 amd64 1.56.1-1 [226 kB] Get: 186 http://deb.debian.org/debian unstable/main amd64 libpangoft2-1.0-0 amd64 1.56.1-1 [55.3 kB] Get: 187 http://deb.debian.org/debian unstable/main amd64 libpangocairo-1.0-0 amd64 1.56.1-1 [35.8 kB] Get: 188 http://deb.debian.org/debian unstable/main amd64 libpangoxft-1.0-0 amd64 1.56.1-1 [27.6 kB] Get: 189 http://deb.debian.org/debian unstable/main amd64 gir1.2-pango-1.0 amd64 1.56.1-1 [39.0 kB] Get: 190 http://deb.debian.org/debian unstable/main amd64 libatspi2.0-0t64 amd64 2.55.0.1-1 [77.0 kB] Get: 191 http://deb.debian.org/debian unstable/main amd64 libatk-bridge2.0-0t64 amd64 2.55.0.1-1 [68.1 kB] Get: 192 http://deb.debian.org/debian unstable/main amd64 libcloudproviders0 amd64 0.3.6-1+b1 [29.2 kB] Get: 193 http://deb.debian.org/debian unstable/main amd64 liblcms2-2 amd64 2.16-2 [160 kB] Get: 194 http://deb.debian.org/debian unstable/main amd64 libcolord2 amd64 1.4.7-1+b2 [140 kB] Get: 195 http://deb.debian.org/debian unstable/main amd64 libavahi-common-data amd64 0.8-16 [112 kB] Get: 196 http://deb.debian.org/debian unstable/main amd64 libavahi-common3 amd64 0.8-16 [44.2 kB] Get: 197 http://deb.debian.org/debian unstable/main amd64 libavahi-client3 amd64 0.8-16 [48.4 kB] Get: 198 http://deb.debian.org/debian unstable/main amd64 libkrb5support0 amd64 1.21.3-4 [32.8 kB] Get: 199 http://deb.debian.org/debian unstable/main amd64 libcom-err2 amd64 1.47.2-1 [24.0 kB] Get: 200 http://deb.debian.org/debian unstable/main amd64 libk5crypto3 amd64 1.21.3-4 [80.9 kB] Get: 201 http://deb.debian.org/debian unstable/main amd64 libkeyutils1 amd64 1.6.3-4 [9092 B] Get: 202 http://deb.debian.org/debian unstable/main amd64 libkrb5-3 amd64 1.21.3-4 [326 kB] Get: 203 http://deb.debian.org/debian unstable/main amd64 libgssapi-krb5-2 amd64 1.21.3-4 [138 kB] Get: 204 http://deb.debian.org/debian unstable/main amd64 libcups2t64 amd64 2.4.10-2+b1 [251 kB] Get: 205 http://deb.debian.org/debian unstable/main amd64 libepoxy0 amd64 1.5.10-2 [193 kB] Get: 206 http://deb.debian.org/debian unstable/main amd64 libwayland-client0 amd64 1.23.0-1+b1 [26.6 kB] Get: 207 http://deb.debian.org/debian unstable/main amd64 libwayland-cursor0 amd64 1.23.0-1+b1 [11.7 kB] Get: 208 http://deb.debian.org/debian unstable/main amd64 libwayland-egl1 amd64 1.23.0-1+b1 [5664 B] Get: 209 http://deb.debian.org/debian unstable/main amd64 libxcomposite1 amd64 1:0.4.6-1 [16.3 kB] Get: 210 http://deb.debian.org/debian unstable/main amd64 libxfixes3 amd64 1:6.0.0-2+b3 [20.2 kB] Get: 211 http://deb.debian.org/debian unstable/main amd64 libxcursor1 amd64 1:1.2.3-1 [39.7 kB] Get: 212 http://deb.debian.org/debian unstable/main amd64 libxdamage1 amd64 1:1.1.6-1+b2 [15.5 kB] Get: 213 http://deb.debian.org/debian unstable/main amd64 libxinerama1 amd64 2:1.1.4-3+b3 [16.0 kB] Get: 214 http://deb.debian.org/debian unstable/main amd64 xkb-data all 2.42-1 [790 kB] Get: 215 http://deb.debian.org/debian unstable/main amd64 libxkbcommon0 amd64 1.7.0-2 [113 kB] Get: 216 http://deb.debian.org/debian unstable/main amd64 libxrandr2 amd64 2:1.5.4-1+b2 [36.4 kB] Get: 217 http://deb.debian.org/debian unstable/main amd64 libgtk-3-common all 3.24.43-5 [4655 kB] Get: 218 http://deb.debian.org/debian unstable/main amd64 libgtk-3-0t64 amd64 3.24.43-5 [2755 kB] Get: 219 http://deb.debian.org/debian unstable/main amd64 gir1.2-gtk-3.0 amd64 3.24.43-5 [223 kB] Get: 220 http://deb.debian.org/debian unstable/main amd64 native-architecture all 0.2.3 [2108 B] Get: 221 http://deb.debian.org/debian unstable/main amd64 libgirepository-2.0-0 amd64 2.82.4-2 [139 kB] Get: 222 http://deb.debian.org/debian unstable/main amd64 girepository-tools amd64 2.82.4-2 [145 kB] Get: 223 http://deb.debian.org/debian unstable/main amd64 gnupg-l10n all 2.2.46-1 [702 kB] Get: 224 http://deb.debian.org/debian unstable/main amd64 gpg amd64 2.2.46-1+b1 [532 kB] Get: 225 http://deb.debian.org/debian unstable/main amd64 pinentry-curses amd64 1.3.1-2 [86.4 kB] Get: 226 http://deb.debian.org/debian unstable/main amd64 gpg-agent amd64 2.2.46-1+b1 [252 kB] Get: 227 http://deb.debian.org/debian unstable/main amd64 gpgsm amd64 2.2.46-1+b1 [255 kB] Get: 228 http://deb.debian.org/debian unstable/main amd64 gnupg all 2.2.46-1 [376 kB] Get: 229 http://deb.debian.org/debian unstable/main amd64 icu-devtools amd64 72.1-6 [210 kB] Get: 230 http://deb.debian.org/debian unstable/main amd64 latexmk all 1:4.86~ds-1 [507 kB] Get: 231 http://deb.debian.org/debian unstable/main amd64 libapache-pom-java all 33-2 [5852 B] Get: 232 http://deb.debian.org/debian unstable/main amd64 libblas3 amd64 3.12.0-4 [152 kB] Get: 233 http://deb.debian.org/debian unstable/main amd64 uuid-dev amd64 2.40.4-1 [47.5 kB] Get: 234 http://deb.debian.org/debian unstable/main amd64 libblkid-dev amd64 2.40.4-1 [205 kB] Get: 235 http://deb.debian.org/debian unstable/main amd64 libboost1.83-dev amd64 1.83.0-4 [10.6 MB] Get: 236 http://deb.debian.org/debian unstable/main amd64 libboost-atomic1.83.0 amd64 1.83.0-4 [234 kB] Get: 237 http://deb.debian.org/debian unstable/main amd64 libboost-atomic1.83-dev amd64 1.83.0-4 [235 kB] Get: 238 http://deb.debian.org/debian unstable/main amd64 libboost-chrono1.83.0t64 amd64 1.83.0-4 [240 kB] Get: 239 http://deb.debian.org/debian unstable/main amd64 libboost-chrono1.83-dev amd64 1.83.0-4 [245 kB] Get: 240 http://deb.debian.org/debian unstable/main amd64 libboost-date-time1.83.0 amd64 1.83.0-4 [230 kB] Get: 241 http://deb.debian.org/debian unstable/main amd64 libboost-serialization1.83.0 amd64 1.83.0-4 [333 kB] Get: 242 http://deb.debian.org/debian unstable/main amd64 libboost-serialization1.83-dev amd64 1.83.0-4 [373 kB] Get: 243 http://deb.debian.org/debian unstable/main amd64 libboost-date-time1.83-dev amd64 1.83.0-4 [239 kB] Get: 244 http://deb.debian.org/debian unstable/main amd64 libboost-system1.83.0 amd64 1.83.0-4 [230 kB] Get: 245 http://deb.debian.org/debian unstable/main amd64 libboost-system1.83-dev amd64 1.83.0-4 [231 kB] Get: 246 http://deb.debian.org/debian unstable/main amd64 libboost-thread1.83.0 amd64 1.83.0-4 [269 kB] Get: 247 http://deb.debian.org/debian unstable/main amd64 libboost-thread1.83-dev amd64 1.83.0-4 [276 kB] Get: 248 http://deb.debian.org/debian unstable/main amd64 libboost-context1.83.0 amd64 1.83.0-4 [231 kB] Get: 249 http://deb.debian.org/debian unstable/main amd64 libboost-context1.83-dev amd64 1.83.0-4 [233 kB] Get: 250 http://deb.debian.org/debian unstable/main amd64 libboost-coroutine1.83.0 amd64 1.83.0-4 [234 kB] Get: 251 http://deb.debian.org/debian unstable/main amd64 libboost-coroutine1.83-dev amd64 1.83.0-4 [236 kB] Get: 252 http://deb.debian.org/debian unstable/main amd64 libboost-coroutine-dev amd64 1.83.0.2+b2 [3868 B] Get: 253 http://deb.debian.org/debian unstable/main amd64 libboost-dev amd64 1.83.0.2+b2 [3836 B] Get: 254 http://deb.debian.org/debian unstable/main amd64 libboost-graph1.83.0 amd64 1.83.0-4 [359 kB] Get: 255 http://deb.debian.org/debian unstable/main amd64 libboost-regex1.83.0 amd64 1.83.0-4 [330 kB] Get: 256 http://deb.debian.org/debian unstable/main amd64 libicu-dev amd64 72.1-6 [10.4 MB] Get: 257 http://deb.debian.org/debian unstable/main amd64 libboost-regex1.83-dev amd64 1.83.0-4 [346 kB] Get: 258 http://deb.debian.org/debian unstable/main amd64 libboost-test1.83.0 amd64 1.83.0-4 [471 kB] Get: 259 http://deb.debian.org/debian unstable/main amd64 libboost-test1.83-dev amd64 1.83.0-4 [541 kB] Get: 260 http://deb.debian.org/debian unstable/main amd64 libboost-graph1.83-dev amd64 1.83.0-4 [383 kB] Get: 261 http://deb.debian.org/debian unstable/main amd64 libboost-graph-dev amd64 1.83.0.2+b2 [3700 B] Get: 262 http://deb.debian.org/debian unstable/main amd64 libboost-iostreams1.83-dev amd64 1.83.0-4 [261 kB] Get: 263 http://deb.debian.org/debian unstable/main amd64 libboost-iostreams-dev amd64 1.83.0.2+b2 [3580 B] Get: 264 http://deb.debian.org/debian unstable/main amd64 libboost-program-options1.83.0 amd64 1.83.0-4 [347 kB] Get: 265 http://deb.debian.org/debian unstable/main amd64 libboost-program-options1.83-dev amd64 1.83.0-4 [375 kB] Get: 266 http://deb.debian.org/debian unstable/main amd64 libboost-program-options-dev amd64 1.83.0.2+b2 [3612 B] Get: 267 http://deb.debian.org/debian unstable/main amd64 libboost-python1.83.0 amd64 1.83.0-4 [320 kB] Get: 268 http://deb.debian.org/debian unstable/main amd64 libpython3.13 amd64 3.13.1-3 [2151 kB] Get: 269 http://deb.debian.org/debian unstable/main amd64 libexpat1-dev amd64 2.6.4-1 [158 kB] Get: 270 http://deb.debian.org/debian unstable/main amd64 zlib1g-dev amd64 1:1.3.dfsg+really1.3.1-1+b1 [920 kB] Get: 271 http://deb.debian.org/debian unstable/main amd64 libpython3.13-dev amd64 3.13.1-3 [5013 kB] Get: 272 http://deb.debian.org/debian unstable/main amd64 libpython3-dev amd64 3.13.1-2 [10.2 kB] Get: 273 http://deb.debian.org/debian unstable/main amd64 python3.13-dev amd64 3.13.1-3 [507 kB] Get: 274 http://deb.debian.org/debian unstable/main amd64 libjs-jquery all 3.6.1+dfsg+~3.5.14-1 [326 kB] Get: 275 http://deb.debian.org/debian unstable/main amd64 libjs-underscore all 1.13.4~dfsg+~1.11.4-3 [116 kB] Get: 276 http://deb.debian.org/debian unstable/main amd64 libjs-sphinxdoc all 8.1.3-4 [30.4 kB] Get: 277 http://deb.debian.org/debian unstable/main amd64 python3-dev amd64 3.13.1-2 [26.1 kB] Get: 278 http://deb.debian.org/debian unstable/main amd64 libboost-python1.83-dev amd64 1.83.0-4 [328 kB] Get: 279 http://deb.debian.org/debian unstable/main amd64 libboost-python-dev amd64 1.83.0.2+b2 [3892 B] Get: 280 http://deb.debian.org/debian unstable/main amd64 libboost-regex-dev amd64 1.83.0.2+b2 [3864 B] Get: 281 http://deb.debian.org/debian unstable/main amd64 libboost-system-dev amd64 1.83.0.2+b2 [3736 B] Get: 282 http://deb.debian.org/debian unstable/main amd64 libboost-thread-dev amd64 1.83.0.2+b2 [3624 B] Get: 283 http://deb.debian.org/debian unstable/main amd64 libbrotli-dev amd64 1.1.0-2+b6 [316 kB] Get: 284 http://deb.debian.org/debian unstable/main amd64 libbz2-dev amd64 1.0.8-6 [31.4 kB] Get: 285 http://deb.debian.org/debian unstable/main amd64 liblzo2-2 amd64 2.10-3+b1 [55.1 kB] Get: 286 http://deb.debian.org/debian unstable/main amd64 libcairo-script-interpreter2 amd64 1.18.2-2 [58.8 kB] Get: 287 http://deb.debian.org/debian unstable/main amd64 libpng-dev amd64 1.6.45-1 [367 kB] Get: 288 http://deb.debian.org/debian unstable/main amd64 libfreetype-dev amd64 2.13.3+dfsg-1 [622 kB] Get: 289 http://deb.debian.org/debian unstable/main amd64 libpkgconf3 amd64 1.8.1-4 [36.4 kB] Get: 290 http://deb.debian.org/debian unstable/main amd64 pkgconf-bin amd64 1.8.1-4 [30.2 kB] Get: 291 http://deb.debian.org/debian unstable/main amd64 pkgconf amd64 1.8.1-4 [26.2 kB] Get: 292 http://deb.debian.org/debian unstable/main amd64 libfontconfig-dev amd64 2.15.0-2 [414 kB] Get: 293 http://deb.debian.org/debian unstable/main amd64 libffi-dev amd64 3.4.6-1 [60.6 kB] Get: 294 http://deb.debian.org/debian unstable/main amd64 libsepol-dev amd64 3.7-1 [370 kB] Get: 295 http://deb.debian.org/debian unstable/main amd64 libpcre2-16-0 amd64 10.44-5 [260 kB] Get: 296 http://deb.debian.org/debian unstable/main amd64 libpcre2-32-0 amd64 10.44-5 [248 kB] Get: 297 http://deb.debian.org/debian unstable/main amd64 libpcre2-posix3 amd64 10.44-5 [60.4 kB] Get: 298 http://deb.debian.org/debian unstable/main amd64 libpcre2-dev amd64 10.44-5 [790 kB] Get: 299 http://deb.debian.org/debian unstable/main amd64 libselinux1-dev amd64 3.7-3+b1 [160 kB] Get: 300 http://deb.debian.org/debian unstable/main amd64 libmount-dev amd64 2.40.4-1 [29.3 kB] Get: 301 http://deb.debian.org/debian unstable/main amd64 libsysprof-capture-4-dev amd64 47.2-1 [47.7 kB] Get: 302 http://deb.debian.org/debian unstable/main amd64 libgio-2.0-dev amd64 2.82.4-2 [1677 kB] Get: 303 http://deb.debian.org/debian unstable/main amd64 libglib2.0-data all 2.82.4-2 [1276 kB] Get: 304 http://deb.debian.org/debian unstable/main amd64 libglib2.0-bin amd64 2.82.4-2 [127 kB] Get: 305 http://deb.debian.org/debian unstable/main amd64 python3-packaging all 24.2-1 [55.3 kB] Get: 306 http://deb.debian.org/debian unstable/main amd64 libgio-2.0-dev-bin amd64 2.82.4-2 [163 kB] Get: 307 http://deb.debian.org/debian unstable/main amd64 libglib2.0-dev-bin amd64 2.82.4-2 [52.1 kB] Get: 308 http://deb.debian.org/debian unstable/main amd64 libglib2.0-dev amd64 2.82.4-2 [52.9 kB] Get: 309 http://deb.debian.org/debian unstable/main amd64 libpixman-1-dev amd64 0.44.0-3 [11.4 kB] Get: 310 http://deb.debian.org/debian unstable/main amd64 xorg-sgml-doctools all 1:1.11-1.1 [22.1 kB] Get: 311 http://deb.debian.org/debian unstable/main amd64 x11proto-dev all 2024.1-1 [603 kB] Get: 312 http://deb.debian.org/debian unstable/main amd64 x11proto-core-dev all 2024.1-1 [3312 B] Get: 313 http://deb.debian.org/debian unstable/main amd64 libice-dev amd64 2:1.1.1-1 [73.8 kB] Get: 314 http://deb.debian.org/debian unstable/main amd64 libsm-dev amd64 2:1.2.4-1 [37.7 kB] Get: 315 http://deb.debian.org/debian unstable/main amd64 libxau-dev amd64 1:1.0.11-1 [23.6 kB] Get: 316 http://deb.debian.org/debian unstable/main amd64 libxdmcp-dev amd64 1:1.1.5-1 [44.3 kB] Get: 317 http://deb.debian.org/debian unstable/main amd64 xtrans-dev all 1.4.0-1 [98.7 kB] Get: 318 http://deb.debian.org/debian unstable/main amd64 libxcb1-dev amd64 1.17.0-2+b1 [181 kB] Get: 319 http://deb.debian.org/debian unstable/main amd64 libx11-dev amd64 2:1.8.10-2 [891 kB] Get: 320 http://deb.debian.org/debian unstable/main amd64 libxcb-render0-dev amd64 1.17.0-2+b1 [118 kB] Get: 321 http://deb.debian.org/debian unstable/main amd64 libxcb-shm0-dev amd64 1.17.0-2+b1 [108 kB] Get: 322 http://deb.debian.org/debian unstable/main amd64 libxext-dev amd64 2:1.3.4-1+b3 [104 kB] Get: 323 http://deb.debian.org/debian unstable/main amd64 libxrender-dev amd64 1:0.9.10-1.1+b3 [35.9 kB] Get: 324 http://deb.debian.org/debian unstable/main amd64 libcairo2-dev amd64 1.18.2-2 [43.0 kB] Get: 325 http://deb.debian.org/debian unstable/main amd64 libcairomm-1.0-1v5 amd64 1.14.5-2+b1 [57.3 kB] Get: 326 http://deb.debian.org/debian unstable/main amd64 libsigc++-2.0-dev amd64 2.12.1-3 [72.3 kB] Get: 327 http://deb.debian.org/debian unstable/main amd64 libcairomm-1.0-dev amd64 1.14.5-2+b1 [69.8 kB] Get: 328 http://deb.debian.org/debian unstable/main amd64 libgmpxx4ldbl amd64 2:6.3.0+dfsg-3 [329 kB] Get: 329 http://deb.debian.org/debian unstable/main amd64 libgmp-dev amd64 2:6.3.0+dfsg-3 [642 kB] Get: 330 http://deb.debian.org/debian unstable/main amd64 libmpfr-dev amd64 4.2.1-1+b2 [268 kB] Get: 331 http://deb.debian.org/debian unstable/main amd64 libcgal-dev amd64 6.0.1-1 [5115 kB] Get: 332 http://deb.debian.org/debian unstable/main amd64 libcommons-parent-java all 56-1 [10.8 kB] Get: 333 http://deb.debian.org/debian unstable/main amd64 libcommons-logging-java all 1.3.0-1 [68.6 kB] Get: 334 http://deb.debian.org/debian unstable/main amd64 libnghttp2-14 amd64 1.64.0-1 [75.5 kB] Get: 335 http://deb.debian.org/debian unstable/main amd64 libnghttp3-9 amd64 1.6.0-2 [64.8 kB] Get: 336 http://deb.debian.org/debian unstable/main amd64 libngtcp2-16 amd64 1.9.1-1 [119 kB] Get: 337 http://deb.debian.org/debian unstable/main amd64 libngtcp2-crypto-gnutls8 amd64 1.9.1-1 [18.5 kB] Get: 338 http://deb.debian.org/debian unstable/main amd64 libpsl5t64 amd64 0.21.2-1.1+b1 [57.2 kB] Get: 339 http://deb.debian.org/debian unstable/main amd64 librtmp1 amd64 2.4+20151223.gitfa8646d.1-2+b5 [58.8 kB] Get: 340 http://deb.debian.org/debian unstable/main amd64 libssh2-1t64 amd64 1.11.1-1 [245 kB] Get: 341 http://deb.debian.org/debian unstable/main amd64 libcurl3t64-gnutls amd64 8.11.1-1+b1 [360 kB] Get: 342 http://deb.debian.org/debian unstable/main amd64 libdav1d7 amd64 1.5.0-1+b1 [550 kB] Get: 343 http://deb.debian.org/debian unstable/main amd64 libfontbox-java all 1:1.8.16-5 [211 kB] Get: 344 http://deb.debian.org/debian unstable/main amd64 libgfortran5 amd64 14.2.0-14 [837 kB] Get: 345 http://deb.debian.org/debian unstable/main amd64 libgpgme11t64 amd64 1.24.1-2 [344 kB] Get: 346 http://deb.debian.org/debian unstable/main amd64 libgpgmepp6t64 amd64 1.24.1-2 [340 kB] Get: 347 http://deb.debian.org/debian unstable/main amd64 libimagequant0 amd64 2.18.0-1+b2 [35.2 kB] Get: 348 http://deb.debian.org/debian unstable/main amd64 libjs-jquery-ui all 1.13.2+dfsg-1 [250 kB] Get: 349 http://deb.debian.org/debian unstable/main amd64 libjs-mathjax all 2.7.9+dfsg-1 [5667 kB] Get: 350 http://deb.debian.org/debian unstable/main amd64 libjson-perl all 4.10000-1 [87.5 kB] Get: 351 http://deb.debian.org/debian unstable/main amd64 liblapack3 amd64 3.12.0-4 [2450 kB] Get: 352 http://deb.debian.org/debian unstable/main amd64 liblbfgsb0 amd64 3.0+dfsg.4-1+b2 [29.4 kB] Get: 353 http://deb.debian.org/debian unstable/main amd64 libnspr4 amd64 2:4.36-1 [110 kB] Get: 354 http://deb.debian.org/debian unstable/main amd64 libnss3 amd64 2:3.107-1 [1390 kB] Get: 355 http://deb.debian.org/debian unstable/main amd64 libopenjp2-7 amd64 2.5.0-2+b4 [199 kB] Get: 356 http://deb.debian.org/debian unstable/main amd64 libpdfbox-java all 1:1.8.16-5 [5527 kB] Get: 357 http://deb.debian.org/debian unstable/main amd64 libpoppler140 amd64 24.08.0-4 [1965 kB] Get: 358 http://deb.debian.org/debian unstable/main amd64 libqhull-r8.0 amd64 2020.2-6+b2 [248 kB] Get: 359 http://deb.debian.org/debian unstable/main amd64 libraqm0 amd64 0.10.2-1 [13.9 kB] Get: 360 http://deb.debian.org/debian unstable/main amd64 librsvg2-2 amd64 2.59.2+dfsg-1 [1854 kB] Get: 361 http://deb.debian.org/debian unstable/main amd64 librsvg2-common amd64 2.59.2+dfsg-1 [152 kB] Get: 362 http://deb.debian.org/debian unstable/main amd64 libsparsehash-dev all 2.0.3-2 [76.8 kB] Get: 363 http://deb.debian.org/debian unstable/main amd64 libvpx9 amd64 1.15.0-1 [1115 kB] Get: 364 http://deb.debian.org/debian unstable/main amd64 libwebpdemux2 amd64 1.5.0-0.1 [113 kB] Get: 365 http://deb.debian.org/debian unstable/main amd64 libwebpmux3 amd64 1.5.0-0.1 [126 kB] Get: 366 http://deb.debian.org/debian unstable/main amd64 libxslt1.1 amd64 1.1.35-1.1+b1 [233 kB] Get: 367 http://deb.debian.org/debian unstable/main amd64 poppler-utils amd64 24.08.0-4 [213 kB] Get: 368 http://deb.debian.org/debian unstable/main amd64 preview-latex-style all 13.2-1 [350 kB] Get: 369 http://deb.debian.org/debian unstable/main amd64 python-babel-localedata all 2.16.0-1 [5696 kB] Get: 370 http://deb.debian.org/debian unstable/main amd64 sphinx-rtd-theme-common all 3.0.2+dfsg-2 [1023 kB] Get: 371 http://deb.debian.org/debian unstable/main amd64 python-ipython-doc all 8.30.0-2 [3496 kB] Get: 372 http://deb.debian.org/debian unstable/main amd64 python-matplotlib-data all 3.8.3-3 [2731 kB] Get: 373 http://deb.debian.org/debian unstable/main amd64 python-mpltoolkits.basemap-doc all 1.2.2+dfsg-5 [35.8 MB] Get: 374 http://deb.debian.org/debian unstable/main amd64 python-pandas-doc all 2.2.3+dfsg-5 [9245 kB] Get: 375 http://deb.debian.org/debian unstable/main amd64 python-scipy-doc all 1.14.1-3 [21.3 MB] Get: 376 http://deb.debian.org/debian unstable/main amd64 python3-alabaster all 0.7.16-0.1 [27.9 kB] Get: 377 http://deb.debian.org/debian unstable/main amd64 python3-attr all 24.3.0-1 [68.8 kB] Get: 378 http://deb.debian.org/debian unstable/main amd64 python3-babel all 2.16.0-1 [114 kB] Get: 379 http://deb.debian.org/debian unstable/main amd64 python3-brotli amd64 1.1.0-2+b6 [321 kB] Get: 380 http://deb.debian.org/debian unstable/main amd64 python3-cairo amd64 1.26.1-2+b1 [130 kB] Get: 381 http://deb.debian.org/debian unstable/main amd64 python3-cairo-dev all 1.26.1-2 [14.4 kB] Get: 382 http://deb.debian.org/debian unstable/main amd64 python3-cairo-doc all 1.26.1-2 [639 kB] Get: 383 http://deb.debian.org/debian unstable/main amd64 python3-certifi all 2024.12.14+ds-1 [9624 B] Get: 384 http://deb.debian.org/debian unstable/main amd64 python3-chardet all 5.2.0+dfsg-2 [108 kB] Get: 385 http://deb.debian.org/debian unstable/main amd64 python3-charset-normalizer amd64 3.4.0-1+b1 [140 kB] Get: 386 http://deb.debian.org/debian unstable/main amd64 python3-numpy amd64 1:1.26.4+ds-13 [4736 kB] Get: 387 http://deb.debian.org/debian unstable/main amd64 python3-contourpy amd64 1.3.1-1 [264 kB] Get: 388 http://deb.debian.org/debian unstable/main amd64 python3-cycler all 0.12.1-1 [9496 B] Get: 389 http://deb.debian.org/debian unstable/main amd64 python3-dateutil all 2.9.0-3 [79.3 kB] Get: 390 http://deb.debian.org/debian unstable/main amd64 python3-decorator all 5.1.1-5 [15.1 kB] Get: 391 http://deb.debian.org/debian unstable/main amd64 python3-defusedxml all 0.7.1-3 [43.4 kB] Get: 392 http://deb.debian.org/debian unstable/main amd64 python3.13-doc all 3.13.1-3 [15.2 MB] Get: 393 http://deb.debian.org/debian unstable/main amd64 python3-doc all 3.13.1-2 [10.1 kB] Get: 394 http://deb.debian.org/debian unstable/main amd64 python3-roman all 4.2-1 [10.4 kB] Get: 395 http://deb.debian.org/debian unstable/main amd64 python3-docutils all 0.21.2+dfsg-2 [403 kB] Get: 396 http://deb.debian.org/debian unstable/main amd64 python3-tz all 2024.2-1 [31.0 kB] Get: 397 http://deb.debian.org/debian unstable/main amd64 python3-platformdirs all 4.3.6-1 [16.6 kB] Get: 398 http://deb.debian.org/debian unstable/main amd64 python3-fs all 2.4.16-6 [95.1 kB] Get: 399 http://deb.debian.org/debian unstable/main amd64 python3-lxml amd64 5.3.0-1+b1 [1676 kB] Get: 400 http://deb.debian.org/debian unstable/main amd64 python3-lz4 amd64 4.4.0+dfsg-1 [25.5 kB] Get: 401 http://deb.debian.org/debian unstable/main amd64 python3-scipy amd64 1.14.1-3 [20.5 MB] Get: 402 http://deb.debian.org/debian unstable/main amd64 python3-mpmath all 1.3.0-1 [419 kB] Get: 403 http://deb.debian.org/debian unstable/main amd64 python3-sympy all 1.13.3-1 [4147 kB] Get: 404 http://deb.debian.org/debian unstable/main amd64 python3-ufolib2 all 0.17.0+dfsg1-1 [33.0 kB] Get: 405 http://deb.debian.org/debian unstable/main amd64 python3-unicodedata2 amd64 15.1.0+ds-1+b3 [299 kB] Get: 406 http://deb.debian.org/debian unstable/main amd64 unicode-data all 15.1.0-1 [8547 kB] Get: 407 http://deb.debian.org/debian unstable/main amd64 python3-fonttools amd64 4.55.3-2 [1633 kB] Get: 408 http://deb.debian.org/debian unstable/main amd64 python3-gi amd64 3.50.0-4 [264 kB] Get: 409 http://deb.debian.org/debian unstable/main amd64 python3-idna all 3.8-2 [41.6 kB] Get: 410 http://deb.debian.org/debian unstable/main amd64 python3-imagesize all 1.4.1-1 [6688 B] Get: 411 http://deb.debian.org/debian unstable/main amd64 python3-markupsafe amd64 2.1.5-1+b2 [13.9 kB] Get: 412 http://deb.debian.org/debian unstable/main amd64 python3-jinja2 all 3.1.5-1 [107 kB] Get: 413 http://deb.debian.org/debian unstable/main amd64 python3-kiwisolver amd64 1.4.7-2+b1 [77.0 kB] Get: 414 http://deb.debian.org/debian unstable/main amd64 python3-pil amd64 11.1.0-1 [306 kB] Get: 415 http://deb.debian.org/debian unstable/main amd64 python3.12-tk amd64 3.12.8-5 [113 kB] Get: 416 http://deb.debian.org/debian unstable/main amd64 python3.13-tk amd64 3.13.1-3 [103 kB] Get: 417 http://deb.debian.org/debian unstable/main amd64 python3-tk amd64 3.13.1-1 [9464 B] Get: 418 http://deb.debian.org/debian unstable/main amd64 python3-pil.imagetk amd64 11.1.0-1 [81.3 kB] Get: 419 http://deb.debian.org/debian unstable/main amd64 python3-pyparsing all 3.1.2-1 [146 kB] Get: 420 http://deb.debian.org/debian unstable/main amd64 python3-matplotlib amd64 3.8.3-3+b1 [5654 kB] Get: 421 http://deb.debian.org/debian unstable/main amd64 sphinx-common all 8.1.3-4 [616 kB] Get: 422 http://deb.debian.org/debian unstable/main amd64 python3-pygments all 2.18.0+dfsg-2 [836 kB] Get: 423 http://deb.debian.org/debian unstable/main amd64 python3-urllib3 all 2.3.0-1 [114 kB] Get: 424 http://deb.debian.org/debian unstable/main amd64 python3-requests all 2.32.3+dfsg-1 [71.9 kB] Get: 425 http://deb.debian.org/debian unstable/main amd64 python3-snowballstemmer all 2.2.0-4 [58.0 kB] Get: 426 http://deb.debian.org/debian unstable/main amd64 python3-sphinx all 8.1.3-4 [468 kB] Get: 427 http://deb.debian.org/debian unstable/main amd64 python3-tabulate all 0.9.0-1 [45.9 kB] Get: 428 http://deb.debian.org/debian unstable/main amd64 python3-numpydoc all 1.8.0-1 [51.4 kB] Get: 429 http://deb.debian.org/debian unstable/main amd64 texlive-fonts-recommended all 2024.20250114-1 [4991 kB] Get: 430 http://deb.debian.org/debian unstable/main amd64 texlive-pictures all 2024.20250114-1 [17.1 MB] Get: 431 http://deb.debian.org/debian unstable/main amd64 texlive-latex-extra all 2024.20250114-1 [24.7 MB] Get: 432 http://deb.debian.org/debian unstable/main amd64 vpx-tools amd64 1.15.0-1 [308 kB] Get: 433 http://deb.debian.org/debian unstable/main amd64 zstd amd64 1.5.6+dfsg-2 [737 kB] Fetched 407 MB in 5s (88.2 MB/s) Preconfiguring packages ... Selecting previously unselected package libsystemd-shared:amd64. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19831 files and directories currently installed.) Preparing to unpack .../libsystemd-shared_257.2-2_amd64.deb ... Unpacking libsystemd-shared:amd64 (257.2-2) ... Selecting previously unselected package libapparmor1:amd64. Preparing to unpack .../libapparmor1_3.1.7-1+b3_amd64.deb ... Unpacking libapparmor1:amd64 (3.1.7-1+b3) ... Setting up libsystemd-shared:amd64 (257.2-2) ... Selecting previously unselected package systemd. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19845 files and directories currently installed.) Preparing to unpack .../systemd_257.2-2_amd64.deb ... Unpacking systemd (257.2-2) ... Setting up libapparmor1:amd64 (3.1.7-1+b3) ... Setting up systemd (257.2-2) ... Created symlink '/etc/systemd/system/getty.target.wants/getty@tty1.service' -> '/usr/lib/systemd/system/getty@.service'. Created symlink '/etc/systemd/system/multi-user.target.wants/remote-fs.target' -> '/usr/lib/systemd/system/remote-fs.target'. Created symlink '/etc/systemd/system/sysinit.target.wants/systemd-pstore.service' -> '/usr/lib/systemd/system/systemd-pstore.service'. Initializing machine ID from random generator. Creating group 'systemd-journal' with GID 999. Creating group 'systemd-network' with GID 998. Creating user 'systemd-network' (systemd Network Management) with UID 998 and GID 998. /usr/lib/tmpfiles.d/legacy.conf:14: Duplicate line for path "/run/lock", ignoring. Selecting previously unselected package systemd-sysv. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 20788 files and directories currently installed.) Preparing to unpack .../00-systemd-sysv_257.2-2_amd64.deb ... Unpacking systemd-sysv (257.2-2) ... Selecting previously unselected package libdbus-1-3:amd64. Preparing to unpack .../01-libdbus-1-3_1.16.0-1_amd64.deb ... Unpacking libdbus-1-3:amd64 (1.16.0-1) ... Selecting previously unselected package dbus-bin. Preparing to unpack .../02-dbus-bin_1.16.0-1_amd64.deb ... Unpacking dbus-bin (1.16.0-1) ... Selecting previously unselected package dbus-session-bus-common. Preparing to unpack .../03-dbus-session-bus-common_1.16.0-1_all.deb ... Unpacking dbus-session-bus-common (1.16.0-1) ... Selecting previously unselected package libexpat1:amd64. Preparing to unpack .../04-libexpat1_2.6.4-1_amd64.deb ... Unpacking libexpat1:amd64 (2.6.4-1) ... Selecting previously unselected package dbus-daemon. Preparing to unpack .../05-dbus-daemon_1.16.0-1_amd64.deb ... Unpacking dbus-daemon (1.16.0-1) ... Selecting previously unselected package dbus-system-bus-common. Preparing to unpack .../06-dbus-system-bus-common_1.16.0-1_all.deb ... Unpacking dbus-system-bus-common (1.16.0-1) ... Selecting previously unselected package dbus. Preparing to unpack .../07-dbus_1.16.0-1_amd64.deb ... Unpacking dbus (1.16.0-1) ... Selecting previously unselected package autoconf-archive. Preparing to unpack .../08-autoconf-archive_20220903-3_all.deb ... Unpacking autoconf-archive (20220903-3) ... Selecting previously unselected package fonts-lato. Preparing to unpack .../09-fonts-lato_2.015-1_all.deb ... Unpacking fonts-lato (2.015-1) ... Selecting previously unselected package libpython3.13-minimal:amd64. Preparing to unpack .../10-libpython3.13-minimal_3.13.1-3_amd64.deb ... Unpacking libpython3.13-minimal:amd64 (3.13.1-3) ... Selecting previously unselected package python3.13-minimal. Preparing to unpack .../11-python3.13-minimal_3.13.1-3_amd64.deb ... Unpacking python3.13-minimal (3.13.1-3) ... Setting up libpython3.13-minimal:amd64 (3.13.1-3) ... Setting up libexpat1:amd64 (2.6.4-1) ... Setting up python3.13-minimal (3.13.1-3) ... Selecting previously unselected package python3-minimal. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 22422 files and directories currently installed.) Preparing to unpack .../0-python3-minimal_3.13.1-2_amd64.deb ... Unpacking python3-minimal (3.13.1-2) ... Selecting previously unselected package media-types. Preparing to unpack .../1-media-types_10.1.0_all.deb ... Unpacking media-types (10.1.0) ... Selecting previously unselected package netbase. Preparing to unpack .../2-netbase_6.4_all.deb ... Unpacking netbase (6.4) ... Selecting previously unselected package tzdata. Preparing to unpack .../3-tzdata_2025a-1_all.deb ... Unpacking tzdata (2025a-1) ... Selecting previously unselected package libffi8:amd64. Preparing to unpack .../4-libffi8_3.4.6-1_amd64.deb ... Unpacking libffi8:amd64 (3.4.6-1) ... Selecting previously unselected package readline-common. Preparing to unpack .../5-readline-common_8.2-6_all.deb ... Unpacking readline-common (8.2-6) ... Selecting previously unselected package libreadline8t64:amd64. Preparing to unpack .../6-libreadline8t64_8.2-6_amd64.deb ... Adding 'diversion of /lib/x86_64-linux-gnu/libhistory.so.8 to /lib/x86_64-linux-gnu/libhistory.so.8.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/x86_64-linux-gnu/libhistory.so.8.2 to /lib/x86_64-linux-gnu/libhistory.so.8.2.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/x86_64-linux-gnu/libreadline.so.8 to /lib/x86_64-linux-gnu/libreadline.so.8.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/x86_64-linux-gnu/libreadline.so.8.2 to /lib/x86_64-linux-gnu/libreadline.so.8.2.usr-is-merged by libreadline8t64' Unpacking libreadline8t64:amd64 (8.2-6) ... Selecting previously unselected package libpython3.13-stdlib:amd64. Preparing to unpack .../7-libpython3.13-stdlib_3.13.1-3_amd64.deb ... Unpacking libpython3.13-stdlib:amd64 (3.13.1-3) ... Selecting previously unselected package python3.13. Preparing to unpack .../8-python3.13_3.13.1-3_amd64.deb ... Unpacking python3.13 (3.13.1-3) ... Selecting previously unselected package libpython3-stdlib:amd64. Preparing to unpack .../9-libpython3-stdlib_3.13.1-2_amd64.deb ... Unpacking libpython3-stdlib:amd64 (3.13.1-2) ... Setting up python3-minimal (3.13.1-2) ... Selecting previously unselected package python3. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 23432 files and directories currently installed.) Preparing to unpack .../000-python3_3.13.1-2_amd64.deb ... Unpacking python3 (3.13.1-2) ... Selecting previously unselected package sgml-base. Preparing to unpack .../001-sgml-base_1.31_all.deb ... Unpacking sgml-base (1.31) ... Selecting previously unselected package libproc2-0:amd64. Preparing to unpack .../002-libproc2-0_2%3a4.0.4-6_amd64.deb ... Unpacking libproc2-0:amd64 (2:4.0.4-6) ... Selecting previously unselected package procps. Preparing to unpack .../003-procps_2%3a4.0.4-6_amd64.deb ... Unpacking procps (2:4.0.4-6) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../004-sensible-utils_0.0.24_all.deb ... Unpacking sensible-utils (0.0.24) ... Selecting previously unselected package openssl. Preparing to unpack .../005-openssl_3.4.0-2_amd64.deb ... Unpacking openssl (3.4.0-2) ... Selecting previously unselected package ca-certificates. Preparing to unpack .../006-ca-certificates_20241223_all.deb ... Unpacking ca-certificates (20241223) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../007-libmagic-mgc_1%3a5.45-3+b1_amd64.deb ... Unpacking libmagic-mgc (1:5.45-3+b1) ... Selecting previously unselected package libmagic1t64:amd64. Preparing to unpack .../008-libmagic1t64_1%3a5.45-3+b1_amd64.deb ... Unpacking libmagic1t64:amd64 (1:5.45-3+b1) ... Selecting previously unselected package file. Preparing to unpack .../009-file_1%3a5.45-3+b1_amd64.deb ... Unpacking file (1:5.45-3+b1) ... Selecting previously unselected package gettext-base. Preparing to unpack .../010-gettext-base_0.23.1-1_amd64.deb ... Unpacking gettext-base (0.23.1-1) ... Selecting previously unselected package libuchardet0:amd64. Preparing to unpack .../011-libuchardet0_0.0.8-1+b2_amd64.deb ... Unpacking libuchardet0:amd64 (0.0.8-1+b2) ... Selecting previously unselected package groff-base. Preparing to unpack .../012-groff-base_1.23.0-7_amd64.deb ... Unpacking groff-base (1.23.0-7) ... Selecting previously unselected package libpam-systemd:amd64. Preparing to unpack .../013-libpam-systemd_257.2-2_amd64.deb ... Unpacking libpam-systemd:amd64 (257.2-2) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../014-bsdextrautils_2.40.4-1_amd64.deb ... Unpacking bsdextrautils (2.40.4-1) ... Selecting previously unselected package libpipeline1:amd64. Preparing to unpack .../015-libpipeline1_1.5.8-1_amd64.deb ... Unpacking libpipeline1:amd64 (1.5.8-1) ... Selecting previously unselected package man-db. Preparing to unpack .../016-man-db_2.13.0-1_amd64.deb ... Unpacking man-db (2.13.0-1) ... Selecting previously unselected package libtext-charwidth-perl:amd64. Preparing to unpack .../017-libtext-charwidth-perl_0.04-11+b4_amd64.deb ... Unpacking libtext-charwidth-perl:amd64 (0.04-11+b4) ... Selecting previously unselected package libtext-wrapi18n-perl. Preparing to unpack .../018-libtext-wrapi18n-perl_0.06-10_all.deb ... Unpacking libtext-wrapi18n-perl (0.06-10) ... Selecting previously unselected package ucf. Preparing to unpack .../019-ucf_3.0048_all.deb ... Moving old data out of the way Unpacking ucf (3.0048) ... Selecting previously unselected package libgdk-pixbuf2.0-common. Preparing to unpack .../020-libgdk-pixbuf2.0-common_2.42.12+dfsg-2_all.deb ... Unpacking libgdk-pixbuf2.0-common (2.42.12+dfsg-2) ... Selecting previously unselected package libglib2.0-0t64:amd64. Preparing to unpack .../021-libglib2.0-0t64_2.82.4-2_amd64.deb ... Unpacking libglib2.0-0t64:amd64 (2.82.4-2) ... Selecting previously unselected package libicu72:amd64. Preparing to unpack .../022-libicu72_72.1-6_amd64.deb ... Unpacking libicu72:amd64 (72.1-6) ... Selecting previously unselected package libxml2:amd64. Preparing to unpack .../023-libxml2_2.12.7+dfsg+really2.9.14-0.2+b1_amd64.deb ... Unpacking libxml2:amd64 (2.12.7+dfsg+really2.9.14-0.2+b1) ... Selecting previously unselected package shared-mime-info. Preparing to unpack .../024-shared-mime-info_2.4-5+b1_amd64.deb ... Unpacking shared-mime-info (2.4-5+b1) ... Selecting previously unselected package libjpeg62-turbo:amd64. Preparing to unpack .../025-libjpeg62-turbo_1%3a2.1.5-3+b1_amd64.deb ... Unpacking libjpeg62-turbo:amd64 (1:2.1.5-3+b1) ... Selecting previously unselected package libpng16-16t64:amd64. Preparing to unpack .../026-libpng16-16t64_1.6.45-1_amd64.deb ... Unpacking libpng16-16t64:amd64 (1.6.45-1) ... Selecting previously unselected package libdeflate0:amd64. Preparing to unpack .../027-libdeflate0_1.23-1+b1_amd64.deb ... Unpacking libdeflate0:amd64 (1.23-1+b1) ... Selecting previously unselected package libjbig0:amd64. Preparing to unpack .../028-libjbig0_2.1-6.1+b2_amd64.deb ... Unpacking libjbig0:amd64 (2.1-6.1+b2) ... Selecting previously unselected package liblerc4:amd64. Preparing to unpack .../029-liblerc4_4.0.0+ds-5_amd64.deb ... Unpacking liblerc4:amd64 (4.0.0+ds-5) ... Selecting previously unselected package libsharpyuv0:amd64. Preparing to unpack .../030-libsharpyuv0_1.5.0-0.1_amd64.deb ... Unpacking libsharpyuv0:amd64 (1.5.0-0.1) ... Selecting previously unselected package libwebp7:amd64. Preparing to unpack .../031-libwebp7_1.5.0-0.1_amd64.deb ... Unpacking libwebp7:amd64 (1.5.0-0.1) ... Selecting previously unselected package libtiff6:amd64. Preparing to unpack .../032-libtiff6_4.5.1+git230720-5_amd64.deb ... Unpacking libtiff6:amd64 (4.5.1+git230720-5) ... Selecting previously unselected package libgdk-pixbuf-2.0-0:amd64. Preparing to unpack .../033-libgdk-pixbuf-2.0-0_2.42.12+dfsg-2_amd64.deb ... Unpacking libgdk-pixbuf-2.0-0:amd64 (2.42.12+dfsg-2) ... Selecting previously unselected package gtk-update-icon-cache. Preparing to unpack .../034-gtk-update-icon-cache_4.16.12+ds-1_amd64.deb ... No diversion 'diversion of /usr/sbin/update-icon-caches to /usr/sbin/update-icon-caches.gtk2 by libgtk-3-bin', none removed. No diversion 'diversion of /usr/share/man/man8/update-icon-caches.8.gz to /usr/share/man/man8/update-icon-caches.gtk2.8.gz by libgtk-3-bin', none removed. Unpacking gtk-update-icon-cache (4.16.12+ds-1) ... Selecting previously unselected package hicolor-icon-theme. Preparing to unpack .../035-hicolor-icon-theme_0.18-2_all.deb ... Unpacking hicolor-icon-theme (0.18-2) ... Selecting previously unselected package adwaita-icon-theme. Preparing to unpack .../036-adwaita-icon-theme_47.0-2_all.deb ... Unpacking adwaita-icon-theme (47.0-2) ... Selecting previously unselected package at-spi2-common. Preparing to unpack .../037-at-spi2-common_2.55.0.1-1_all.deb ... Unpacking at-spi2-common (2.55.0.1-1) ... Selecting previously unselected package m4. Preparing to unpack .../038-m4_1.4.19-5_amd64.deb ... Unpacking m4 (1.4.19-5) ... Selecting previously unselected package autoconf. Preparing to unpack .../039-autoconf_2.72-3_all.deb ... Unpacking autoconf (2.72-3) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../040-autotools-dev_20220109.1_all.deb ... Unpacking autotools-dev (20220109.1) ... Selecting previously unselected package automake. Preparing to unpack .../041-automake_1%3a1.16.5-1.3_all.deb ... Unpacking automake (1:1.16.5-1.3) ... Selecting previously unselected package autopoint. Preparing to unpack .../042-autopoint_0.23.1-1_all.deb ... Unpacking autopoint (0.23.1-1) ... Selecting previously unselected package libtcl8.6:amd64. Preparing to unpack .../043-libtcl8.6_8.6.16+dfsg-1_amd64.deb ... Unpacking libtcl8.6:amd64 (8.6.16+dfsg-1) ... Selecting previously unselected package libbrotli1:amd64. Preparing to unpack .../044-libbrotli1_1.1.0-2+b6_amd64.deb ... Unpacking libbrotli1:amd64 (1.1.0-2+b6) ... Selecting previously unselected package libfreetype6:amd64. Preparing to unpack .../045-libfreetype6_2.13.3+dfsg-1_amd64.deb ... Unpacking libfreetype6:amd64 (2.13.3+dfsg-1) ... Selecting previously unselected package fonts-dejavu-mono. Preparing to unpack .../046-fonts-dejavu-mono_2.37-8_all.deb ... Unpacking fonts-dejavu-mono (2.37-8) ... Selecting previously unselected package fonts-dejavu-core. Preparing to unpack .../047-fonts-dejavu-core_2.37-8_all.deb ... Unpacking fonts-dejavu-core (2.37-8) ... Selecting previously unselected package fontconfig-config. Preparing to unpack .../048-fontconfig-config_2.15.0-2_amd64.deb ... Unpacking fontconfig-config (2.15.0-2) ... Selecting previously unselected package libfontconfig1:amd64. Preparing to unpack .../049-libfontconfig1_2.15.0-2_amd64.deb ... Unpacking libfontconfig1:amd64 (2.15.0-2) ... Selecting previously unselected package libxau6:amd64. Preparing to unpack .../050-libxau6_1%3a1.0.11-1_amd64.deb ... Unpacking libxau6:amd64 (1:1.0.11-1) ... Selecting previously unselected package libxdmcp6:amd64. Preparing to unpack .../051-libxdmcp6_1%3a1.1.5-1_amd64.deb ... Unpacking libxdmcp6:amd64 (1:1.1.5-1) ... Selecting previously unselected package libxcb1:amd64. Preparing to unpack .../052-libxcb1_1.17.0-2+b1_amd64.deb ... Unpacking libxcb1:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libx11-data. Preparing to unpack .../053-libx11-data_2%3a1.8.10-2_all.deb ... Unpacking libx11-data (2:1.8.10-2) ... Selecting previously unselected package libx11-6:amd64. Preparing to unpack .../054-libx11-6_2%3a1.8.10-2_amd64.deb ... Unpacking libx11-6:amd64 (2:1.8.10-2) ... Selecting previously unselected package libxrender1:amd64. Preparing to unpack .../055-libxrender1_1%3a0.9.10-1.1+b3_amd64.deb ... Unpacking libxrender1:amd64 (1:0.9.10-1.1+b3) ... Selecting previously unselected package libxft2:amd64. Preparing to unpack .../056-libxft2_2.3.6-1+b3_amd64.deb ... Unpacking libxft2:amd64 (2.3.6-1+b3) ... Selecting previously unselected package libxext6:amd64. Preparing to unpack .../057-libxext6_2%3a1.3.4-1+b3_amd64.deb ... Unpacking libxext6:amd64 (2:1.3.4-1+b3) ... Selecting previously unselected package x11-common. Preparing to unpack .../058-x11-common_1%3a7.7+23.2_all.deb ... Unpacking x11-common (1:7.7+23.2) ... Selecting previously unselected package libxss1:amd64. Preparing to unpack .../059-libxss1_1%3a1.2.3-1+b3_amd64.deb ... Unpacking libxss1:amd64 (1:1.2.3-1+b3) ... Selecting previously unselected package libtk8.6:amd64. Preparing to unpack .../060-libtk8.6_8.6.16-1_amd64.deb ... Unpacking libtk8.6:amd64 (8.6.16-1) ... Selecting previously unselected package tk8.6-blt2.5. Preparing to unpack .../061-tk8.6-blt2.5_2.5.3+dfsg-7_amd64.deb ... Unpacking tk8.6-blt2.5 (2.5.3+dfsg-7) ... Selecting previously unselected package blt. Preparing to unpack .../062-blt_2.5.3+dfsg-7_amd64.deb ... Unpacking blt (2.5.3+dfsg-7) ... Selecting previously unselected package tex-common. Preparing to unpack .../063-tex-common_6.18_all.deb ... Unpacking tex-common (6.18) ... Selecting previously unselected package libpaper2:amd64. Preparing to unpack .../064-libpaper2_2.2.5-0.3_amd64.deb ... Unpacking libpaper2:amd64 (2.2.5-0.3) ... Selecting previously unselected package libpaper-utils. Preparing to unpack .../065-libpaper-utils_2.2.5-0.3_amd64.deb ... Unpacking libpaper-utils (2.2.5-0.3) ... Selecting previously unselected package libkpathsea6:amd64. Preparing to unpack .../066-libkpathsea6_2024.20240313.70630+ds-5+b1_amd64.deb ... Unpacking libkpathsea6:amd64 (2024.20240313.70630+ds-5+b1) ... Selecting previously unselected package libptexenc1:amd64. Preparing to unpack .../067-libptexenc1_2024.20240313.70630+ds-5+b1_amd64.deb ... Unpacking libptexenc1:amd64 (2024.20240313.70630+ds-5+b1) ... Selecting previously unselected package libsynctex2:amd64. Preparing to unpack .../068-libsynctex2_2024.20240313.70630+ds-5+b1_amd64.deb ... Unpacking libsynctex2:amd64 (2024.20240313.70630+ds-5+b1) ... Selecting previously unselected package libtexlua53-5:amd64. Preparing to unpack .../069-libtexlua53-5_2024.20240313.70630+ds-5+b1_amd64.deb ... Unpacking libtexlua53-5:amd64 (2024.20240313.70630+ds-5+b1) ... Selecting previously unselected package t1utils. Preparing to unpack .../070-t1utils_1.41-4_amd64.deb ... Unpacking t1utils (1.41-4) ... Selecting previously unselected package libpixman-1-0:amd64. Preparing to unpack .../071-libpixman-1-0_0.44.0-3_amd64.deb ... Unpacking libpixman-1-0:amd64 (0.44.0-3) ... Selecting previously unselected package libxcb-render0:amd64. Preparing to unpack .../072-libxcb-render0_1.17.0-2+b1_amd64.deb ... Unpacking libxcb-render0:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libxcb-shm0:amd64. Preparing to unpack .../073-libxcb-shm0_1.17.0-2+b1_amd64.deb ... Unpacking libxcb-shm0:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libcairo2:amd64. Preparing to unpack .../074-libcairo2_1.18.2-2_amd64.deb ... Unpacking libcairo2:amd64 (1.18.2-2) ... Selecting previously unselected package libgraphite2-3:amd64. Preparing to unpack .../075-libgraphite2-3_1.3.14-2+b1_amd64.deb ... Unpacking libgraphite2-3:amd64 (1.3.14-2+b1) ... Selecting previously unselected package libharfbuzz0b:amd64. Preparing to unpack .../076-libharfbuzz0b_10.2.0-1_amd64.deb ... Unpacking libharfbuzz0b:amd64 (10.2.0-1) ... Selecting previously unselected package libmpfi0:amd64. Preparing to unpack .../077-libmpfi0_1.5.4+ds-4_amd64.deb ... Unpacking libmpfi0:amd64 (1.5.4+ds-4) ... Selecting previously unselected package libpotrace0:amd64. Preparing to unpack .../078-libpotrace0_1.16-2+b2_amd64.deb ... Unpacking libpotrace0:amd64 (1.16-2+b2) ... Selecting previously unselected package libteckit0:amd64. Preparing to unpack .../079-libteckit0_2.5.12+ds1-1+b1_amd64.deb ... Unpacking libteckit0:amd64 (2.5.12+ds1-1+b1) ... Selecting previously unselected package libice6:amd64. Preparing to unpack .../080-libice6_2%3a1.1.1-1_amd64.deb ... Unpacking libice6:amd64 (2:1.1.1-1) ... Selecting previously unselected package libsm6:amd64. Preparing to unpack .../081-libsm6_2%3a1.2.4-1_amd64.deb ... Unpacking libsm6:amd64 (2:1.2.4-1) ... Selecting previously unselected package libxt6t64:amd64. Preparing to unpack .../082-libxt6t64_1%3a1.2.1-1.2+b2_amd64.deb ... Unpacking libxt6t64:amd64 (1:1.2.1-1.2+b2) ... Selecting previously unselected package libxmu6:amd64. Preparing to unpack .../083-libxmu6_2%3a1.1.3-3+b4_amd64.deb ... Unpacking libxmu6:amd64 (2:1.1.3-3+b4) ... Selecting previously unselected package libxpm4:amd64. Preparing to unpack .../084-libxpm4_1%3a3.5.17-1+b3_amd64.deb ... Unpacking libxpm4:amd64 (1:3.5.17-1+b3) ... Selecting previously unselected package libxaw7:amd64. Preparing to unpack .../085-libxaw7_2%3a1.0.16-1_amd64.deb ... Unpacking libxaw7:amd64 (2:1.0.16-1) ... Selecting previously unselected package libxi6:amd64. Preparing to unpack .../086-libxi6_2%3a1.8.2-1_amd64.deb ... Unpacking libxi6:amd64 (2:1.8.2-1) ... Selecting previously unselected package libzzip-0-13t64:amd64. Preparing to unpack .../087-libzzip-0-13t64_0.13.72+dfsg.1-1.3_amd64.deb ... Unpacking libzzip-0-13t64:amd64 (0.13.72+dfsg.1-1.3) ... Selecting previously unselected package texlive-binaries. Preparing to unpack .../088-texlive-binaries_2024.20240313.70630+ds-5+b1_amd64.deb ... Unpacking texlive-binaries (2024.20240313.70630+ds-5+b1) ... Selecting previously unselected package xdg-utils. Preparing to unpack .../089-xdg-utils_1.2.1-2_all.deb ... Unpacking xdg-utils (1.2.1-2) ... Selecting previously unselected package texlive-base. Preparing to unpack .../090-texlive-base_2024.20250114-1_all.deb ... Unpacking texlive-base (2024.20250114-1) ... Selecting previously unselected package fonts-lmodern. Preparing to unpack .../091-fonts-lmodern_2.005-1_all.deb ... Unpacking fonts-lmodern (2.005-1) ... Selecting previously unselected package texlive-latex-base. Preparing to unpack .../092-texlive-latex-base_2024.20250114-1_all.deb ... Unpacking texlive-latex-base (2024.20250114-1) ... Selecting previously unselected package texlive-latex-recommended. Preparing to unpack .../093-texlive-latex-recommended_2024.20250114-1_all.deb ... Unpacking texlive-latex-recommended (2024.20250114-1) ... Selecting previously unselected package cm-super-minimal. Preparing to unpack .../094-cm-super-minimal_0.3.4-17_all.deb ... Unpacking cm-super-minimal (0.3.4-17) ... Selecting previously unselected package dbus-user-session. Preparing to unpack .../095-dbus-user-session_1.16.0-1_amd64.deb ... Unpacking dbus-user-session (1.16.0-1) ... Selecting previously unselected package libdconf1:amd64. Preparing to unpack .../096-libdconf1_0.40.0-5_amd64.deb ... Unpacking libdconf1:amd64 (0.40.0-5) ... Selecting previously unselected package dconf-service. Preparing to unpack .../097-dconf-service_0.40.0-5_amd64.deb ... Unpacking dconf-service (0.40.0-5) ... Selecting previously unselected package dconf-gsettings-backend:amd64. Preparing to unpack .../098-dconf-gsettings-backend_0.40.0-5_amd64.deb ... Unpacking dconf-gsettings-backend:amd64 (0.40.0-5) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../099-libdebhelper-perl_13.24.1_all.deb ... Unpacking libdebhelper-perl (13.24.1) ... Selecting previously unselected package libtool. Preparing to unpack .../100-libtool_2.5.4-2_all.deb ... Unpacking libtool (2.5.4-2) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../101-dh-autoreconf_20_all.deb ... Unpacking dh-autoreconf (20) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../102-libarchive-zip-perl_1.68-1_all.deb ... Unpacking libarchive-zip-perl (1.68-1) ... Selecting previously unselected package libfile-stripnondeterminism-perl. Preparing to unpack .../103-libfile-stripnondeterminism-perl_1.14.1-1_all.deb ... Unpacking libfile-stripnondeterminism-perl (1.14.1-1) ... Selecting previously unselected package dh-strip-nondeterminism. Preparing to unpack .../104-dh-strip-nondeterminism_1.14.1-1_all.deb ... Unpacking dh-strip-nondeterminism (1.14.1-1) ... Selecting previously unselected package libelf1t64:amd64. Preparing to unpack .../105-libelf1t64_0.192-4_amd64.deb ... Unpacking libelf1t64:amd64 (0.192-4) ... Selecting previously unselected package dwz. Preparing to unpack .../106-dwz_0.15-1+b1_amd64.deb ... Unpacking dwz (0.15-1+b1) ... Selecting previously unselected package libunistring5:amd64. Preparing to unpack .../107-libunistring5_1.3-1_amd64.deb ... Unpacking libunistring5:amd64 (1.3-1) ... Selecting previously unselected package gettext. Preparing to unpack .../108-gettext_0.23.1-1_amd64.deb ... Unpacking gettext (0.23.1-1) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../109-intltool-debian_0.35.0+20060710.6_all.deb ... Unpacking intltool-debian (0.35.0+20060710.6) ... Selecting previously unselected package po-debconf. Preparing to unpack .../110-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../111-debhelper_13.24.1_all.deb ... Unpacking debhelper (13.24.1) ... Selecting previously unselected package python3-autocommand. Preparing to unpack .../112-python3-autocommand_2.2.2-3_all.deb ... Unpacking python3-autocommand (2.2.2-3) ... Selecting previously unselected package python3-more-itertools. Preparing to unpack .../113-python3-more-itertools_10.6.0-1_all.deb ... Unpacking python3-more-itertools (10.6.0-1) ... Selecting previously unselected package python3-typing-extensions. Preparing to unpack .../114-python3-typing-extensions_4.12.2-2_all.deb ... Unpacking python3-typing-extensions (4.12.2-2) ... Selecting previously unselected package python3-typeguard. Preparing to unpack .../115-python3-typeguard_4.4.1-1_all.deb ... Unpacking python3-typeguard (4.4.1-1) ... Selecting previously unselected package python3-inflect. Preparing to unpack .../116-python3-inflect_7.3.1-2_all.deb ... Unpacking python3-inflect (7.3.1-2) ... Selecting previously unselected package python3-jaraco.context. Preparing to unpack .../117-python3-jaraco.context_6.0.0-1_all.deb ... Unpacking python3-jaraco.context (6.0.0-1) ... Selecting previously unselected package python3-jaraco.functools. Preparing to unpack .../118-python3-jaraco.functools_4.1.0-1_all.deb ... Unpacking python3-jaraco.functools (4.1.0-1) ... Selecting previously unselected package python3-pkg-resources. Preparing to unpack .../119-python3-pkg-resources_75.6.0-1_all.deb ... Unpacking python3-pkg-resources (75.6.0-1) ... Selecting previously unselected package python3-jaraco.text. Preparing to unpack .../120-python3-jaraco.text_4.0.0-1_all.deb ... Unpacking python3-jaraco.text (4.0.0-1) ... Selecting previously unselected package python3-zipp. Preparing to unpack .../121-python3-zipp_3.21.0-1_all.deb ... Unpacking python3-zipp (3.21.0-1) ... Selecting previously unselected package python3-setuptools. Preparing to unpack .../122-python3-setuptools_75.6.0-1_all.deb ... Unpacking python3-setuptools (75.6.0-1) ... Selecting previously unselected package dh-python. Preparing to unpack .../123-dh-python_6.20250108_all.deb ... Unpacking dh-python (6.20250108) ... Selecting previously unselected package libgpg-error0:amd64. Preparing to unpack .../124-libgpg-error0_1.51-3_amd64.deb ... Unpacking libgpg-error0:amd64 (1.51-3) ... Selecting previously unselected package libassuan9:amd64. Preparing to unpack .../125-libassuan9_3.0.1-2_amd64.deb ... Unpacking libassuan9:amd64 (3.0.1-2) ... Selecting previously unselected package libgcrypt20:amd64. Preparing to unpack .../126-libgcrypt20_1.11.0-7_amd64.deb ... Unpacking libgcrypt20:amd64 (1.11.0-7) ... Selecting previously unselected package gpgconf. Preparing to unpack .../127-gpgconf_2.2.46-1+b1_amd64.deb ... Unpacking gpgconf (2.2.46-1+b1) ... Selecting previously unselected package libidn2-0:amd64. Preparing to unpack .../128-libidn2-0_2.3.7-2+b1_amd64.deb ... Unpacking libidn2-0:amd64 (2.3.7-2+b1) ... Selecting previously unselected package libp11-kit0:amd64. Preparing to unpack .../129-libp11-kit0_0.25.5-3_amd64.deb ... Unpacking libp11-kit0:amd64 (0.25.5-3) ... Selecting previously unselected package libtasn1-6:amd64. Preparing to unpack .../130-libtasn1-6_4.19.0-3+b3_amd64.deb ... Unpacking libtasn1-6:amd64 (4.19.0-3+b3) ... Selecting previously unselected package libgnutls30t64:amd64. Preparing to unpack .../131-libgnutls30t64_3.8.8-2_amd64.deb ... Unpacking libgnutls30t64:amd64 (3.8.8-2) ... Selecting previously unselected package libksba8:amd64. Preparing to unpack .../132-libksba8_1.6.7-2+b1_amd64.deb ... Unpacking libksba8:amd64 (1.6.7-2+b1) ... Selecting previously unselected package libsasl2-modules-db:amd64. Preparing to unpack .../133-libsasl2-modules-db_2.1.28+dfsg1-8+b1_amd64.deb ... Unpacking libsasl2-modules-db:amd64 (2.1.28+dfsg1-8+b1) ... Selecting previously unselected package libsasl2-2:amd64. Preparing to unpack .../134-libsasl2-2_2.1.28+dfsg1-8+b1_amd64.deb ... Unpacking libsasl2-2:amd64 (2.1.28+dfsg1-8+b1) ... Selecting previously unselected package libldap2:amd64. Preparing to unpack .../135-libldap2_2.6.9+dfsg-1_amd64.deb ... Unpacking libldap2:amd64 (2.6.9+dfsg-1) ... Selecting previously unselected package libnpth0t64:amd64. Preparing to unpack .../136-libnpth0t64_1.8-2_amd64.deb ... Unpacking libnpth0t64:amd64 (1.8-2) ... Selecting previously unselected package dirmngr. Preparing to unpack .../137-dirmngr_2.2.46-1+b1_amd64.deb ... Unpacking dirmngr (2.2.46-1+b1) ... Selecting previously unselected package xml-core. Preparing to unpack .../138-xml-core_0.19_all.deb ... Unpacking xml-core (0.19) ... Selecting previously unselected package docutils-common. Preparing to unpack .../139-docutils-common_0.21.2+dfsg-2_all.deb ... Unpacking docutils-common (0.21.2+dfsg-2) ... Selecting previously unselected package fontconfig. Preparing to unpack .../140-fontconfig_2.15.0-2_amd64.deb ... Unpacking fontconfig (2.15.0-2) ... Selecting previously unselected package fonts-font-awesome. Preparing to unpack .../141-fonts-font-awesome_5.0.10+really4.7.0~dfsg-4.1_all.deb ... Unpacking fonts-font-awesome (5.0.10+really4.7.0~dfsg-4.1) ... Selecting previously unselected package fonts-lyx. Preparing to unpack .../142-fonts-lyx_2.4.3-1_all.deb ... Unpacking fonts-lyx (2.4.3-1) ... Selecting previously unselected package fonts-mathjax. Preparing to unpack .../143-fonts-mathjax_2.7.9+dfsg-1_all.deb ... Unpacking fonts-mathjax (2.7.9+dfsg-1) ... Selecting previously unselected package fonts-open-sans. Preparing to unpack .../144-fonts-open-sans_1.11-2_all.deb ... Unpacking fonts-open-sans (1.11-2) ... Selecting previously unselected package gir1.2-glib-2.0:amd64. Preparing to unpack .../145-gir1.2-glib-2.0_2.82.4-2_amd64.deb ... Unpacking gir1.2-glib-2.0:amd64 (2.82.4-2) ... Selecting previously unselected package libatk1.0-0t64:amd64. Preparing to unpack .../146-libatk1.0-0t64_2.55.0.1-1_amd64.deb ... Unpacking libatk1.0-0t64:amd64 (2.55.0.1-1) ... Selecting previously unselected package gir1.2-atk-1.0:amd64. Preparing to unpack .../147-gir1.2-atk-1.0_2.55.0.1-1_amd64.deb ... Unpacking gir1.2-atk-1.0:amd64 (2.55.0.1-1) ... Selecting previously unselected package libcairo-gobject2:amd64. Preparing to unpack .../148-libcairo-gobject2_1.18.2-2_amd64.deb ... Unpacking libcairo-gobject2:amd64 (1.18.2-2) ... Selecting previously unselected package gir1.2-freedesktop:amd64. Preparing to unpack .../149-gir1.2-freedesktop_1.82.0-4_amd64.deb ... Unpacking gir1.2-freedesktop:amd64 (1.82.0-4) ... Selecting previously unselected package gir1.2-gdkpixbuf-2.0:amd64. Preparing to unpack .../150-gir1.2-gdkpixbuf-2.0_2.42.12+dfsg-2_amd64.deb ... Unpacking gir1.2-gdkpixbuf-2.0:amd64 (2.42.12+dfsg-2) ... Selecting previously unselected package libgirepository-1.0-1:amd64. Preparing to unpack .../151-libgirepository-1.0-1_1.82.0-4_amd64.deb ... Unpacking libgirepository-1.0-1:amd64 (1.82.0-4) ... Selecting previously unselected package gir1.2-girepository-2.0:amd64. Preparing to unpack .../152-gir1.2-girepository-2.0_1.82.0-4_amd64.deb ... Unpacking gir1.2-girepository-2.0:amd64 (1.82.0-4) ... Selecting previously unselected package libharfbuzz-gobject0:amd64. Preparing to unpack .../153-libharfbuzz-gobject0_10.2.0-1_amd64.deb ... Unpacking libharfbuzz-gobject0:amd64 (10.2.0-1) ... Selecting previously unselected package gir1.2-harfbuzz-0.0:amd64. Preparing to unpack .../154-gir1.2-harfbuzz-0.0_10.2.0-1_amd64.deb ... Unpacking gir1.2-harfbuzz-0.0:amd64 (10.2.0-1) ... Selecting previously unselected package libfribidi0:amd64. Preparing to unpack .../155-libfribidi0_1.0.16-1_amd64.deb ... Unpacking libfribidi0:amd64 (1.0.16-1) ... Selecting previously unselected package libthai-data. Preparing to unpack .../156-libthai-data_0.1.29-2_all.deb ... Unpacking libthai-data (0.1.29-2) ... Selecting previously unselected package libdatrie1:amd64. Preparing to unpack .../157-libdatrie1_0.2.13-3+b1_amd64.deb ... Unpacking libdatrie1:amd64 (0.2.13-3+b1) ... Selecting previously unselected package libthai0:amd64. Preparing to unpack .../158-libthai0_0.1.29-2+b1_amd64.deb ... Unpacking libthai0:amd64 (0.1.29-2+b1) ... Selecting previously unselected package libpango-1.0-0:amd64. Preparing to unpack .../159-libpango-1.0-0_1.56.1-1_amd64.deb ... Unpacking libpango-1.0-0:amd64 (1.56.1-1) ... Selecting previously unselected package libpangoft2-1.0-0:amd64. Preparing to unpack .../160-libpangoft2-1.0-0_1.56.1-1_amd64.deb ... Unpacking libpangoft2-1.0-0:amd64 (1.56.1-1) ... Selecting previously unselected package libpangocairo-1.0-0:amd64. Preparing to unpack .../161-libpangocairo-1.0-0_1.56.1-1_amd64.deb ... Unpacking libpangocairo-1.0-0:amd64 (1.56.1-1) ... Selecting previously unselected package libpangoxft-1.0-0:amd64. Preparing to unpack .../162-libpangoxft-1.0-0_1.56.1-1_amd64.deb ... Unpacking libpangoxft-1.0-0:amd64 (1.56.1-1) ... Selecting previously unselected package gir1.2-pango-1.0:amd64. Preparing to unpack .../163-gir1.2-pango-1.0_1.56.1-1_amd64.deb ... Unpacking gir1.2-pango-1.0:amd64 (1.56.1-1) ... Selecting previously unselected package libatspi2.0-0t64:amd64. Preparing to unpack .../164-libatspi2.0-0t64_2.55.0.1-1_amd64.deb ... Unpacking libatspi2.0-0t64:amd64 (2.55.0.1-1) ... Selecting previously unselected package libatk-bridge2.0-0t64:amd64. Preparing to unpack .../165-libatk-bridge2.0-0t64_2.55.0.1-1_amd64.deb ... Unpacking libatk-bridge2.0-0t64:amd64 (2.55.0.1-1) ... Selecting previously unselected package libcloudproviders0:amd64. Preparing to unpack .../166-libcloudproviders0_0.3.6-1+b1_amd64.deb ... Unpacking libcloudproviders0:amd64 (0.3.6-1+b1) ... Selecting previously unselected package liblcms2-2:amd64. Preparing to unpack .../167-liblcms2-2_2.16-2_amd64.deb ... Unpacking liblcms2-2:amd64 (2.16-2) ... Selecting previously unselected package libcolord2:amd64. Preparing to unpack .../168-libcolord2_1.4.7-1+b2_amd64.deb ... Unpacking libcolord2:amd64 (1.4.7-1+b2) ... Selecting previously unselected package libavahi-common-data:amd64. Preparing to unpack .../169-libavahi-common-data_0.8-16_amd64.deb ... Unpacking libavahi-common-data:amd64 (0.8-16) ... Selecting previously unselected package libavahi-common3:amd64. Preparing to unpack .../170-libavahi-common3_0.8-16_amd64.deb ... Unpacking libavahi-common3:amd64 (0.8-16) ... Selecting previously unselected package libavahi-client3:amd64. Preparing to unpack .../171-libavahi-client3_0.8-16_amd64.deb ... Unpacking libavahi-client3:amd64 (0.8-16) ... Selecting previously unselected package libkrb5support0:amd64. Preparing to unpack .../172-libkrb5support0_1.21.3-4_amd64.deb ... Unpacking libkrb5support0:amd64 (1.21.3-4) ... Selecting previously unselected package libcom-err2:amd64. Preparing to unpack .../173-libcom-err2_1.47.2-1_amd64.deb ... Unpacking libcom-err2:amd64 (1.47.2-1) ... Selecting previously unselected package libk5crypto3:amd64. Preparing to unpack .../174-libk5crypto3_1.21.3-4_amd64.deb ... Unpacking libk5crypto3:amd64 (1.21.3-4) ... Selecting previously unselected package libkeyutils1:amd64. Preparing to unpack .../175-libkeyutils1_1.6.3-4_amd64.deb ... Unpacking libkeyutils1:amd64 (1.6.3-4) ... Selecting previously unselected package libkrb5-3:amd64. Preparing to unpack .../176-libkrb5-3_1.21.3-4_amd64.deb ... Unpacking libkrb5-3:amd64 (1.21.3-4) ... Selecting previously unselected package libgssapi-krb5-2:amd64. Preparing to unpack .../177-libgssapi-krb5-2_1.21.3-4_amd64.deb ... Unpacking libgssapi-krb5-2:amd64 (1.21.3-4) ... Selecting previously unselected package libcups2t64:amd64. Preparing to unpack .../178-libcups2t64_2.4.10-2+b1_amd64.deb ... Unpacking libcups2t64:amd64 (2.4.10-2+b1) ... Selecting previously unselected package libepoxy0:amd64. Preparing to unpack .../179-libepoxy0_1.5.10-2_amd64.deb ... Unpacking libepoxy0:amd64 (1.5.10-2) ... Selecting previously unselected package libwayland-client0:amd64. Preparing to unpack .../180-libwayland-client0_1.23.0-1+b1_amd64.deb ... Unpacking libwayland-client0:amd64 (1.23.0-1+b1) ... Selecting previously unselected package libwayland-cursor0:amd64. Preparing to unpack .../181-libwayland-cursor0_1.23.0-1+b1_amd64.deb ... Unpacking libwayland-cursor0:amd64 (1.23.0-1+b1) ... Selecting previously unselected package libwayland-egl1:amd64. Preparing to unpack .../182-libwayland-egl1_1.23.0-1+b1_amd64.deb ... Unpacking libwayland-egl1:amd64 (1.23.0-1+b1) ... Selecting previously unselected package libxcomposite1:amd64. Preparing to unpack .../183-libxcomposite1_1%3a0.4.6-1_amd64.deb ... Unpacking libxcomposite1:amd64 (1:0.4.6-1) ... Selecting previously unselected package libxfixes3:amd64. Preparing to unpack .../184-libxfixes3_1%3a6.0.0-2+b3_amd64.deb ... Unpacking libxfixes3:amd64 (1:6.0.0-2+b3) ... Selecting previously unselected package libxcursor1:amd64. Preparing to unpack .../185-libxcursor1_1%3a1.2.3-1_amd64.deb ... Unpacking libxcursor1:amd64 (1:1.2.3-1) ... Selecting previously unselected package libxdamage1:amd64. Preparing to unpack .../186-libxdamage1_1%3a1.1.6-1+b2_amd64.deb ... Unpacking libxdamage1:amd64 (1:1.1.6-1+b2) ... Selecting previously unselected package libxinerama1:amd64. Preparing to unpack .../187-libxinerama1_2%3a1.1.4-3+b3_amd64.deb ... Unpacking libxinerama1:amd64 (2:1.1.4-3+b3) ... Selecting previously unselected package xkb-data. Preparing to unpack .../188-xkb-data_2.42-1_all.deb ... Unpacking xkb-data (2.42-1) ... Selecting previously unselected package libxkbcommon0:amd64. Preparing to unpack .../189-libxkbcommon0_1.7.0-2_amd64.deb ... Unpacking libxkbcommon0:amd64 (1.7.0-2) ... Selecting previously unselected package libxrandr2:amd64. Preparing to unpack .../190-libxrandr2_2%3a1.5.4-1+b2_amd64.deb ... Unpacking libxrandr2:amd64 (2:1.5.4-1+b2) ... Selecting previously unselected package libgtk-3-common. Preparing to unpack .../191-libgtk-3-common_3.24.43-5_all.deb ... Unpacking libgtk-3-common (3.24.43-5) ... Selecting previously unselected package libgtk-3-0t64:amd64. Preparing to unpack .../192-libgtk-3-0t64_3.24.43-5_amd64.deb ... Unpacking libgtk-3-0t64:amd64 (3.24.43-5) ... Selecting previously unselected package gir1.2-gtk-3.0:amd64. Preparing to unpack .../193-gir1.2-gtk-3.0_3.24.43-5_amd64.deb ... Unpacking gir1.2-gtk-3.0:amd64 (3.24.43-5) ... Selecting previously unselected package native-architecture. Preparing to unpack .../194-native-architecture_0.2.3_all.deb ... Unpacking native-architecture (0.2.3) ... Selecting previously unselected package libgirepository-2.0-0:amd64. Preparing to unpack .../195-libgirepository-2.0-0_2.82.4-2_amd64.deb ... Unpacking libgirepository-2.0-0:amd64 (2.82.4-2) ... Selecting previously unselected package girepository-tools:amd64. Preparing to unpack .../196-girepository-tools_2.82.4-2_amd64.deb ... Unpacking girepository-tools:amd64 (2.82.4-2) ... Selecting previously unselected package gnupg-l10n. Preparing to unpack .../197-gnupg-l10n_2.2.46-1_all.deb ... Unpacking gnupg-l10n (2.2.46-1) ... Selecting previously unselected package gpg. Preparing to unpack .../198-gpg_2.2.46-1+b1_amd64.deb ... Unpacking gpg (2.2.46-1+b1) ... Selecting previously unselected package pinentry-curses. Preparing to unpack .../199-pinentry-curses_1.3.1-2_amd64.deb ... Unpacking pinentry-curses (1.3.1-2) ... Selecting previously unselected package gpg-agent. Preparing to unpack .../200-gpg-agent_2.2.46-1+b1_amd64.deb ... Unpacking gpg-agent (2.2.46-1+b1) ... Selecting previously unselected package gpgsm. Preparing to unpack .../201-gpgsm_2.2.46-1+b1_amd64.deb ... Unpacking gpgsm (2.2.46-1+b1) ... Selecting previously unselected package gnupg. Preparing to unpack .../202-gnupg_2.2.46-1_all.deb ... Unpacking gnupg (2.2.46-1) ... Selecting previously unselected package icu-devtools. Preparing to unpack .../203-icu-devtools_72.1-6_amd64.deb ... Unpacking icu-devtools (72.1-6) ... Selecting previously unselected package latexmk. Preparing to unpack .../204-latexmk_1%3a4.86~ds-1_all.deb ... Unpacking latexmk (1:4.86~ds-1) ... Selecting previously unselected package libapache-pom-java. Preparing to unpack .../205-libapache-pom-java_33-2_all.deb ... Unpacking libapache-pom-java (33-2) ... Selecting previously unselected package libblas3:amd64. Preparing to unpack .../206-libblas3_3.12.0-4_amd64.deb ... Unpacking libblas3:amd64 (3.12.0-4) ... Selecting previously unselected package uuid-dev:amd64. Preparing to unpack .../207-uuid-dev_2.40.4-1_amd64.deb ... Unpacking uuid-dev:amd64 (2.40.4-1) ... Selecting previously unselected package libblkid-dev:amd64. Preparing to unpack .../208-libblkid-dev_2.40.4-1_amd64.deb ... Unpacking libblkid-dev:amd64 (2.40.4-1) ... Selecting previously unselected package libboost1.83-dev:amd64. Preparing to unpack .../209-libboost1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-atomic1.83.0:amd64. Preparing to unpack .../210-libboost-atomic1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-atomic1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-atomic1.83-dev:amd64. Preparing to unpack .../211-libboost-atomic1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-atomic1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-chrono1.83.0t64:amd64. Preparing to unpack .../212-libboost-chrono1.83.0t64_1.83.0-4_amd64.deb ... Unpacking libboost-chrono1.83.0t64:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-chrono1.83-dev:amd64. Preparing to unpack .../213-libboost-chrono1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-chrono1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-date-time1.83.0:amd64. Preparing to unpack .../214-libboost-date-time1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-date-time1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-serialization1.83.0:amd64. Preparing to unpack .../215-libboost-serialization1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-serialization1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-serialization1.83-dev:amd64. Preparing to unpack .../216-libboost-serialization1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-serialization1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-date-time1.83-dev:amd64. Preparing to unpack .../217-libboost-date-time1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-date-time1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-system1.83.0:amd64. Preparing to unpack .../218-libboost-system1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-system1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-system1.83-dev:amd64. Preparing to unpack .../219-libboost-system1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-system1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-thread1.83.0:amd64. Preparing to unpack .../220-libboost-thread1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-thread1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-thread1.83-dev:amd64. Preparing to unpack .../221-libboost-thread1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-thread1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-context1.83.0:amd64. Preparing to unpack .../222-libboost-context1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-context1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-context1.83-dev:amd64. Preparing to unpack .../223-libboost-context1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-context1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-coroutine1.83.0:amd64. Preparing to unpack .../224-libboost-coroutine1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-coroutine1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-coroutine1.83-dev:amd64. Preparing to unpack .../225-libboost-coroutine1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-coroutine1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-coroutine-dev:amd64. Preparing to unpack .../226-libboost-coroutine-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-coroutine-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libboost-dev:amd64. Preparing to unpack .../227-libboost-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libboost-graph1.83.0:amd64. Preparing to unpack .../228-libboost-graph1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-graph1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-regex1.83.0:amd64. Preparing to unpack .../229-libboost-regex1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-regex1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libicu-dev:amd64. Preparing to unpack .../230-libicu-dev_72.1-6_amd64.deb ... Unpacking libicu-dev:amd64 (72.1-6) ... Selecting previously unselected package libboost-regex1.83-dev:amd64. Preparing to unpack .../231-libboost-regex1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-regex1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-test1.83.0:amd64. Preparing to unpack .../232-libboost-test1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-test1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-test1.83-dev:amd64. Preparing to unpack .../233-libboost-test1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-test1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-graph1.83-dev:amd64. Preparing to unpack .../234-libboost-graph1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-graph1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-graph-dev:amd64. Preparing to unpack .../235-libboost-graph-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-graph-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libboost-iostreams1.83-dev:amd64. Preparing to unpack .../236-libboost-iostreams1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-iostreams1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-iostreams-dev:amd64. Preparing to unpack .../237-libboost-iostreams-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-iostreams-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libboost-program-options1.83.0:amd64. Preparing to unpack .../238-libboost-program-options1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-program-options1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-program-options1.83-dev:amd64. Preparing to unpack .../239-libboost-program-options1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-program-options1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-program-options-dev:amd64. Preparing to unpack .../240-libboost-program-options-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-program-options-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libboost-python1.83.0. Preparing to unpack .../241-libboost-python1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-python1.83.0 (1.83.0-4) ... Selecting previously unselected package libpython3.13:amd64. Preparing to unpack .../242-libpython3.13_3.13.1-3_amd64.deb ... Unpacking libpython3.13:amd64 (3.13.1-3) ... Selecting previously unselected package libexpat1-dev:amd64. Preparing to unpack .../243-libexpat1-dev_2.6.4-1_amd64.deb ... Unpacking libexpat1-dev:amd64 (2.6.4-1) ... Selecting previously unselected package zlib1g-dev:amd64. Preparing to unpack .../244-zlib1g-dev_1%3a1.3.dfsg+really1.3.1-1+b1_amd64.deb ... Unpacking zlib1g-dev:amd64 (1:1.3.dfsg+really1.3.1-1+b1) ... Selecting previously unselected package libpython3.13-dev:amd64. Preparing to unpack .../245-libpython3.13-dev_3.13.1-3_amd64.deb ... Unpacking libpython3.13-dev:amd64 (3.13.1-3) ... Selecting previously unselected package libpython3-dev:amd64. Preparing to unpack .../246-libpython3-dev_3.13.1-2_amd64.deb ... Unpacking libpython3-dev:amd64 (3.13.1-2) ... Selecting previously unselected package python3.13-dev. Preparing to unpack .../247-python3.13-dev_3.13.1-3_amd64.deb ... Unpacking python3.13-dev (3.13.1-3) ... Selecting previously unselected package libjs-jquery. Preparing to unpack .../248-libjs-jquery_3.6.1+dfsg+~3.5.14-1_all.deb ... Unpacking libjs-jquery (3.6.1+dfsg+~3.5.14-1) ... Selecting previously unselected package libjs-underscore. Preparing to unpack .../249-libjs-underscore_1.13.4~dfsg+~1.11.4-3_all.deb ... Unpacking libjs-underscore (1.13.4~dfsg+~1.11.4-3) ... Selecting previously unselected package libjs-sphinxdoc. Preparing to unpack .../250-libjs-sphinxdoc_8.1.3-4_all.deb ... Unpacking libjs-sphinxdoc (8.1.3-4) ... Selecting previously unselected package python3-dev. Preparing to unpack .../251-python3-dev_3.13.1-2_amd64.deb ... Unpacking python3-dev (3.13.1-2) ... Selecting previously unselected package libboost-python1.83-dev. Preparing to unpack .../252-libboost-python1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-python1.83-dev (1.83.0-4) ... Selecting previously unselected package libboost-python-dev. Preparing to unpack .../253-libboost-python-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-python-dev (1.83.0.2+b2) ... Selecting previously unselected package libboost-regex-dev:amd64. Preparing to unpack .../254-libboost-regex-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-regex-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libboost-system-dev:amd64. Preparing to unpack .../255-libboost-system-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-system-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libboost-thread-dev:amd64. Preparing to unpack .../256-libboost-thread-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-thread-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libbrotli-dev:amd64. Preparing to unpack .../257-libbrotli-dev_1.1.0-2+b6_amd64.deb ... Unpacking libbrotli-dev:amd64 (1.1.0-2+b6) ... Selecting previously unselected package libbz2-dev:amd64. Preparing to unpack .../258-libbz2-dev_1.0.8-6_amd64.deb ... Unpacking libbz2-dev:amd64 (1.0.8-6) ... Selecting previously unselected package liblzo2-2:amd64. Preparing to unpack .../259-liblzo2-2_2.10-3+b1_amd64.deb ... Unpacking liblzo2-2:amd64 (2.10-3+b1) ... Selecting previously unselected package libcairo-script-interpreter2:amd64. Preparing to unpack .../260-libcairo-script-interpreter2_1.18.2-2_amd64.deb ... Unpacking libcairo-script-interpreter2:amd64 (1.18.2-2) ... Selecting previously unselected package libpng-dev:amd64. Preparing to unpack .../261-libpng-dev_1.6.45-1_amd64.deb ... Unpacking libpng-dev:amd64 (1.6.45-1) ... Selecting previously unselected package libfreetype-dev:amd64. Preparing to unpack .../262-libfreetype-dev_2.13.3+dfsg-1_amd64.deb ... Unpacking libfreetype-dev:amd64 (2.13.3+dfsg-1) ... Selecting previously unselected package libpkgconf3:amd64. Preparing to unpack .../263-libpkgconf3_1.8.1-4_amd64.deb ... Unpacking libpkgconf3:amd64 (1.8.1-4) ... Selecting previously unselected package pkgconf-bin. Preparing to unpack .../264-pkgconf-bin_1.8.1-4_amd64.deb ... Unpacking pkgconf-bin (1.8.1-4) ... Selecting previously unselected package pkgconf:amd64. Preparing to unpack .../265-pkgconf_1.8.1-4_amd64.deb ... Unpacking pkgconf:amd64 (1.8.1-4) ... Selecting previously unselected package libfontconfig-dev:amd64. Preparing to unpack .../266-libfontconfig-dev_2.15.0-2_amd64.deb ... Unpacking libfontconfig-dev:amd64 (2.15.0-2) ... Selecting previously unselected package libffi-dev:amd64. Preparing to unpack .../267-libffi-dev_3.4.6-1_amd64.deb ... Unpacking libffi-dev:amd64 (3.4.6-1) ... Selecting previously unselected package libsepol-dev:amd64. Preparing to unpack .../268-libsepol-dev_3.7-1_amd64.deb ... Unpacking libsepol-dev:amd64 (3.7-1) ... Selecting previously unselected package libpcre2-16-0:amd64. Preparing to unpack .../269-libpcre2-16-0_10.44-5_amd64.deb ... Unpacking libpcre2-16-0:amd64 (10.44-5) ... Selecting previously unselected package libpcre2-32-0:amd64. Preparing to unpack .../270-libpcre2-32-0_10.44-5_amd64.deb ... Unpacking libpcre2-32-0:amd64 (10.44-5) ... Selecting previously unselected package libpcre2-posix3:amd64. Preparing to unpack .../271-libpcre2-posix3_10.44-5_amd64.deb ... Unpacking libpcre2-posix3:amd64 (10.44-5) ... Selecting previously unselected package libpcre2-dev:amd64. Preparing to unpack .../272-libpcre2-dev_10.44-5_amd64.deb ... Unpacking libpcre2-dev:amd64 (10.44-5) ... Selecting previously unselected package libselinux1-dev:amd64. Preparing to unpack .../273-libselinux1-dev_3.7-3+b1_amd64.deb ... Unpacking libselinux1-dev:amd64 (3.7-3+b1) ... Selecting previously unselected package libmount-dev:amd64. Preparing to unpack .../274-libmount-dev_2.40.4-1_amd64.deb ... Unpacking libmount-dev:amd64 (2.40.4-1) ... Selecting previously unselected package libsysprof-capture-4-dev:amd64. Preparing to unpack .../275-libsysprof-capture-4-dev_47.2-1_amd64.deb ... Unpacking libsysprof-capture-4-dev:amd64 (47.2-1) ... Selecting previously unselected package libgio-2.0-dev:amd64. Preparing to unpack .../276-libgio-2.0-dev_2.82.4-2_amd64.deb ... Unpacking libgio-2.0-dev:amd64 (2.82.4-2) ... Selecting previously unselected package libglib2.0-data. Preparing to unpack .../277-libglib2.0-data_2.82.4-2_all.deb ... Unpacking libglib2.0-data (2.82.4-2) ... Selecting previously unselected package libglib2.0-bin. Preparing to unpack .../278-libglib2.0-bin_2.82.4-2_amd64.deb ... Unpacking libglib2.0-bin (2.82.4-2) ... Selecting previously unselected package python3-packaging. Preparing to unpack .../279-python3-packaging_24.2-1_all.deb ... Unpacking python3-packaging (24.2-1) ... Selecting previously unselected package libgio-2.0-dev-bin. Preparing to unpack .../280-libgio-2.0-dev-bin_2.82.4-2_amd64.deb ... Unpacking libgio-2.0-dev-bin (2.82.4-2) ... Selecting previously unselected package libglib2.0-dev-bin. Preparing to unpack .../281-libglib2.0-dev-bin_2.82.4-2_amd64.deb ... Unpacking libglib2.0-dev-bin (2.82.4-2) ... Selecting previously unselected package libglib2.0-dev:amd64. Preparing to unpack .../282-libglib2.0-dev_2.82.4-2_amd64.deb ... Unpacking libglib2.0-dev:amd64 (2.82.4-2) ... Selecting previously unselected package libpixman-1-dev:amd64. Preparing to unpack .../283-libpixman-1-dev_0.44.0-3_amd64.deb ... Unpacking libpixman-1-dev:amd64 (0.44.0-3) ... Selecting previously unselected package xorg-sgml-doctools. Preparing to unpack .../284-xorg-sgml-doctools_1%3a1.11-1.1_all.deb ... Unpacking xorg-sgml-doctools (1:1.11-1.1) ... Selecting previously unselected package x11proto-dev. Preparing to unpack .../285-x11proto-dev_2024.1-1_all.deb ... Unpacking x11proto-dev (2024.1-1) ... Selecting previously unselected package x11proto-core-dev. Preparing to unpack .../286-x11proto-core-dev_2024.1-1_all.deb ... Unpacking x11proto-core-dev (2024.1-1) ... Selecting previously unselected package libice-dev:amd64. Preparing to unpack .../287-libice-dev_2%3a1.1.1-1_amd64.deb ... Unpacking libice-dev:amd64 (2:1.1.1-1) ... Selecting previously unselected package libsm-dev:amd64. Preparing to unpack .../288-libsm-dev_2%3a1.2.4-1_amd64.deb ... Unpacking libsm-dev:amd64 (2:1.2.4-1) ... Selecting previously unselected package libxau-dev:amd64. Preparing to unpack .../289-libxau-dev_1%3a1.0.11-1_amd64.deb ... Unpacking libxau-dev:amd64 (1:1.0.11-1) ... Selecting previously unselected package libxdmcp-dev:amd64. Preparing to unpack .../290-libxdmcp-dev_1%3a1.1.5-1_amd64.deb ... Unpacking libxdmcp-dev:amd64 (1:1.1.5-1) ... Selecting previously unselected package xtrans-dev. Preparing to unpack .../291-xtrans-dev_1.4.0-1_all.deb ... Unpacking xtrans-dev (1.4.0-1) ... Selecting previously unselected package libxcb1-dev:amd64. Preparing to unpack .../292-libxcb1-dev_1.17.0-2+b1_amd64.deb ... Unpacking libxcb1-dev:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libx11-dev:amd64. Preparing to unpack .../293-libx11-dev_2%3a1.8.10-2_amd64.deb ... Unpacking libx11-dev:amd64 (2:1.8.10-2) ... Selecting previously unselected package libxcb-render0-dev:amd64. Preparing to unpack .../294-libxcb-render0-dev_1.17.0-2+b1_amd64.deb ... Unpacking libxcb-render0-dev:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libxcb-shm0-dev:amd64. Preparing to unpack .../295-libxcb-shm0-dev_1.17.0-2+b1_amd64.deb ... Unpacking libxcb-shm0-dev:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libxext-dev:amd64. Preparing to unpack .../296-libxext-dev_2%3a1.3.4-1+b3_amd64.deb ... Unpacking libxext-dev:amd64 (2:1.3.4-1+b3) ... Selecting previously unselected package libxrender-dev:amd64. Preparing to unpack .../297-libxrender-dev_1%3a0.9.10-1.1+b3_amd64.deb ... Unpacking libxrender-dev:amd64 (1:0.9.10-1.1+b3) ... Selecting previously unselected package libcairo2-dev:amd64. Preparing to unpack .../298-libcairo2-dev_1.18.2-2_amd64.deb ... Unpacking libcairo2-dev:amd64 (1.18.2-2) ... Selecting previously unselected package libcairomm-1.0-1v5:amd64. Preparing to unpack .../299-libcairomm-1.0-1v5_1.14.5-2+b1_amd64.deb ... Unpacking libcairomm-1.0-1v5:amd64 (1.14.5-2+b1) ... Selecting previously unselected package libsigc++-2.0-dev:amd64. Preparing to unpack .../300-libsigc++-2.0-dev_2.12.1-3_amd64.deb ... Unpacking libsigc++-2.0-dev:amd64 (2.12.1-3) ... Selecting previously unselected package libcairomm-1.0-dev:amd64. Preparing to unpack .../301-libcairomm-1.0-dev_1.14.5-2+b1_amd64.deb ... Unpacking libcairomm-1.0-dev:amd64 (1.14.5-2+b1) ... Selecting previously unselected package libgmpxx4ldbl:amd64. Preparing to unpack .../302-libgmpxx4ldbl_2%3a6.3.0+dfsg-3_amd64.deb ... Unpacking libgmpxx4ldbl:amd64 (2:6.3.0+dfsg-3) ... Selecting previously unselected package libgmp-dev:amd64. Preparing to unpack .../303-libgmp-dev_2%3a6.3.0+dfsg-3_amd64.deb ... Unpacking libgmp-dev:amd64 (2:6.3.0+dfsg-3) ... Selecting previously unselected package libmpfr-dev:amd64. Preparing to unpack .../304-libmpfr-dev_4.2.1-1+b2_amd64.deb ... Unpacking libmpfr-dev:amd64 (4.2.1-1+b2) ... Selecting previously unselected package libcgal-dev:amd64. Preparing to unpack .../305-libcgal-dev_6.0.1-1_amd64.deb ... Unpacking libcgal-dev:amd64 (6.0.1-1) ... Selecting previously unselected package libcommons-parent-java. Preparing to unpack .../306-libcommons-parent-java_56-1_all.deb ... Unpacking libcommons-parent-java (56-1) ... Selecting previously unselected package libcommons-logging-java. Preparing to unpack .../307-libcommons-logging-java_1.3.0-1_all.deb ... Unpacking libcommons-logging-java (1.3.0-1) ... Selecting previously unselected package libnghttp2-14:amd64. Preparing to unpack .../308-libnghttp2-14_1.64.0-1_amd64.deb ... Unpacking libnghttp2-14:amd64 (1.64.0-1) ... Selecting previously unselected package libnghttp3-9:amd64. Preparing to unpack .../309-libnghttp3-9_1.6.0-2_amd64.deb ... Unpacking libnghttp3-9:amd64 (1.6.0-2) ... Selecting previously unselected package libngtcp2-16:amd64. Preparing to unpack .../310-libngtcp2-16_1.9.1-1_amd64.deb ... Unpacking libngtcp2-16:amd64 (1.9.1-1) ... Selecting previously unselected package libngtcp2-crypto-gnutls8:amd64. Preparing to unpack .../311-libngtcp2-crypto-gnutls8_1.9.1-1_amd64.deb ... Unpacking libngtcp2-crypto-gnutls8:amd64 (1.9.1-1) ... Selecting previously unselected package libpsl5t64:amd64. Preparing to unpack .../312-libpsl5t64_0.21.2-1.1+b1_amd64.deb ... Unpacking libpsl5t64:amd64 (0.21.2-1.1+b1) ... Selecting previously unselected package librtmp1:amd64. Preparing to unpack .../313-librtmp1_2.4+20151223.gitfa8646d.1-2+b5_amd64.deb ... Unpacking librtmp1:amd64 (2.4+20151223.gitfa8646d.1-2+b5) ... Selecting previously unselected package libssh2-1t64:amd64. Preparing to unpack .../314-libssh2-1t64_1.11.1-1_amd64.deb ... Unpacking libssh2-1t64:amd64 (1.11.1-1) ... Selecting previously unselected package libcurl3t64-gnutls:amd64. Preparing to unpack .../315-libcurl3t64-gnutls_8.11.1-1+b1_amd64.deb ... Unpacking libcurl3t64-gnutls:amd64 (8.11.1-1+b1) ... Selecting previously unselected package libdav1d7:amd64. Preparing to unpack .../316-libdav1d7_1.5.0-1+b1_amd64.deb ... Unpacking libdav1d7:amd64 (1.5.0-1+b1) ... Selecting previously unselected package libfontbox-java. Preparing to unpack .../317-libfontbox-java_1%3a1.8.16-5_all.deb ... Unpacking libfontbox-java (1:1.8.16-5) ... Selecting previously unselected package libgfortran5:amd64. Preparing to unpack .../318-libgfortran5_14.2.0-14_amd64.deb ... Unpacking libgfortran5:amd64 (14.2.0-14) ... Selecting previously unselected package libgpgme11t64:amd64. Preparing to unpack .../319-libgpgme11t64_1.24.1-2_amd64.deb ... Unpacking libgpgme11t64:amd64 (1.24.1-2) ... Selecting previously unselected package libgpgmepp6t64:amd64. Preparing to unpack .../320-libgpgmepp6t64_1.24.1-2_amd64.deb ... Unpacking libgpgmepp6t64:amd64 (1.24.1-2) ... Selecting previously unselected package libimagequant0:amd64. Preparing to unpack .../321-libimagequant0_2.18.0-1+b2_amd64.deb ... Unpacking libimagequant0:amd64 (2.18.0-1+b2) ... Selecting previously unselected package libjs-jquery-ui. Preparing to unpack .../322-libjs-jquery-ui_1.13.2+dfsg-1_all.deb ... Unpacking libjs-jquery-ui (1.13.2+dfsg-1) ... Selecting previously unselected package libjs-mathjax. Preparing to unpack .../323-libjs-mathjax_2.7.9+dfsg-1_all.deb ... Unpacking libjs-mathjax (2.7.9+dfsg-1) ... Selecting previously unselected package libjson-perl. Preparing to unpack .../324-libjson-perl_4.10000-1_all.deb ... Unpacking libjson-perl (4.10000-1) ... Selecting previously unselected package liblapack3:amd64. Preparing to unpack .../325-liblapack3_3.12.0-4_amd64.deb ... Unpacking liblapack3:amd64 (3.12.0-4) ... Selecting previously unselected package liblbfgsb0:amd64. Preparing to unpack .../326-liblbfgsb0_3.0+dfsg.4-1+b2_amd64.deb ... Unpacking liblbfgsb0:amd64 (3.0+dfsg.4-1+b2) ... Selecting previously unselected package libnspr4:amd64. Preparing to unpack .../327-libnspr4_2%3a4.36-1_amd64.deb ... Unpacking libnspr4:amd64 (2:4.36-1) ... Selecting previously unselected package libnss3:amd64. Preparing to unpack .../328-libnss3_2%3a3.107-1_amd64.deb ... Unpacking libnss3:amd64 (2:3.107-1) ... Selecting previously unselected package libopenjp2-7:amd64. Preparing to unpack .../329-libopenjp2-7_2.5.0-2+b4_amd64.deb ... Unpacking libopenjp2-7:amd64 (2.5.0-2+b4) ... Selecting previously unselected package libpdfbox-java. Preparing to unpack .../330-libpdfbox-java_1%3a1.8.16-5_all.deb ... Unpacking libpdfbox-java (1:1.8.16-5) ... Selecting previously unselected package libpoppler140:amd64. Preparing to unpack .../331-libpoppler140_24.08.0-4_amd64.deb ... Unpacking libpoppler140:amd64 (24.08.0-4) ... Selecting previously unselected package libqhull-r8.0:amd64. Preparing to unpack .../332-libqhull-r8.0_2020.2-6+b2_amd64.deb ... Unpacking libqhull-r8.0:amd64 (2020.2-6+b2) ... Selecting previously unselected package libraqm0:amd64. Preparing to unpack .../333-libraqm0_0.10.2-1_amd64.deb ... Unpacking libraqm0:amd64 (0.10.2-1) ... Selecting previously unselected package librsvg2-2:amd64. Preparing to unpack .../334-librsvg2-2_2.59.2+dfsg-1_amd64.deb ... Unpacking librsvg2-2:amd64 (2.59.2+dfsg-1) ... Selecting previously unselected package librsvg2-common:amd64. Preparing to unpack .../335-librsvg2-common_2.59.2+dfsg-1_amd64.deb ... Unpacking librsvg2-common:amd64 (2.59.2+dfsg-1) ... Selecting previously unselected package libsparsehash-dev. Preparing to unpack .../336-libsparsehash-dev_2.0.3-2_all.deb ... Unpacking libsparsehash-dev (2.0.3-2) ... Selecting previously unselected package libvpx9:amd64. Preparing to unpack .../337-libvpx9_1.15.0-1_amd64.deb ... Unpacking libvpx9:amd64 (1.15.0-1) ... Selecting previously unselected package libwebpdemux2:amd64. Preparing to unpack .../338-libwebpdemux2_1.5.0-0.1_amd64.deb ... Unpacking libwebpdemux2:amd64 (1.5.0-0.1) ... Selecting previously unselected package libwebpmux3:amd64. Preparing to unpack .../339-libwebpmux3_1.5.0-0.1_amd64.deb ... Unpacking libwebpmux3:amd64 (1.5.0-0.1) ... Selecting previously unselected package libxslt1.1:amd64. Preparing to unpack .../340-libxslt1.1_1.1.35-1.1+b1_amd64.deb ... Unpacking libxslt1.1:amd64 (1.1.35-1.1+b1) ... Selecting previously unselected package poppler-utils. Preparing to unpack .../341-poppler-utils_24.08.0-4_amd64.deb ... Unpacking poppler-utils (24.08.0-4) ... Selecting previously unselected package preview-latex-style. Preparing to unpack .../342-preview-latex-style_13.2-1_all.deb ... Unpacking preview-latex-style (13.2-1) ... Selecting previously unselected package python-babel-localedata. Preparing to unpack .../343-python-babel-localedata_2.16.0-1_all.deb ... Unpacking python-babel-localedata (2.16.0-1) ... Selecting previously unselected package sphinx-rtd-theme-common. Preparing to unpack .../344-sphinx-rtd-theme-common_3.0.2+dfsg-2_all.deb ... Unpacking sphinx-rtd-theme-common (3.0.2+dfsg-2) ... Selecting previously unselected package python-ipython-doc. Preparing to unpack .../345-python-ipython-doc_8.30.0-2_all.deb ... Unpacking python-ipython-doc (8.30.0-2) ... Selecting previously unselected package python-matplotlib-data. Preparing to unpack .../346-python-matplotlib-data_3.8.3-3_all.deb ... Unpacking python-matplotlib-data (3.8.3-3) ... Selecting previously unselected package python-mpltoolkits.basemap-doc. Preparing to unpack .../347-python-mpltoolkits.basemap-doc_1.2.2+dfsg-5_all.deb ... Unpacking python-mpltoolkits.basemap-doc (1.2.2+dfsg-5) ... Selecting previously unselected package python-pandas-doc. Preparing to unpack .../348-python-pandas-doc_2.2.3+dfsg-5_all.deb ... Unpacking python-pandas-doc (2.2.3+dfsg-5) ... Selecting previously unselected package python-scipy-doc. Preparing to unpack .../349-python-scipy-doc_1.14.1-3_all.deb ... Unpacking python-scipy-doc (1.14.1-3) ... Selecting previously unselected package python3-alabaster. Preparing to unpack .../350-python3-alabaster_0.7.16-0.1_all.deb ... Unpacking python3-alabaster (0.7.16-0.1) ... Selecting previously unselected package python3-attr. Preparing to unpack .../351-python3-attr_24.3.0-1_all.deb ... Unpacking python3-attr (24.3.0-1) ... Selecting previously unselected package python3-babel. Preparing to unpack .../352-python3-babel_2.16.0-1_all.deb ... Unpacking python3-babel (2.16.0-1) ... Selecting previously unselected package python3-brotli. Preparing to unpack .../353-python3-brotli_1.1.0-2+b6_amd64.deb ... Unpacking python3-brotli (1.1.0-2+b6) ... Selecting previously unselected package python3-cairo. Preparing to unpack .../354-python3-cairo_1.26.1-2+b1_amd64.deb ... Unpacking python3-cairo (1.26.1-2+b1) ... Selecting previously unselected package python3-cairo-dev. Preparing to unpack .../355-python3-cairo-dev_1.26.1-2_all.deb ... Unpacking python3-cairo-dev (1.26.1-2) ... Selecting previously unselected package python3-cairo-doc. Preparing to unpack .../356-python3-cairo-doc_1.26.1-2_all.deb ... Unpacking python3-cairo-doc (1.26.1-2) ... Selecting previously unselected package python3-certifi. Preparing to unpack .../357-python3-certifi_2024.12.14+ds-1_all.deb ... Unpacking python3-certifi (2024.12.14+ds-1) ... Selecting previously unselected package python3-chardet. Preparing to unpack .../358-python3-chardet_5.2.0+dfsg-2_all.deb ... Unpacking python3-chardet (5.2.0+dfsg-2) ... Selecting previously unselected package python3-charset-normalizer. Preparing to unpack .../359-python3-charset-normalizer_3.4.0-1+b1_amd64.deb ... Unpacking python3-charset-normalizer (3.4.0-1+b1) ... Selecting previously unselected package python3-numpy. Preparing to unpack .../360-python3-numpy_1%3a1.26.4+ds-13_amd64.deb ... Unpacking python3-numpy (1:1.26.4+ds-13) ... Selecting previously unselected package python3-contourpy. Preparing to unpack .../361-python3-contourpy_1.3.1-1_amd64.deb ... Unpacking python3-contourpy (1.3.1-1) ... Selecting previously unselected package python3-cycler. Preparing to unpack .../362-python3-cycler_0.12.1-1_all.deb ... Unpacking python3-cycler (0.12.1-1) ... Selecting previously unselected package python3-dateutil. Preparing to unpack .../363-python3-dateutil_2.9.0-3_all.deb ... Unpacking python3-dateutil (2.9.0-3) ... Selecting previously unselected package python3-decorator. Preparing to unpack .../364-python3-decorator_5.1.1-5_all.deb ... Unpacking python3-decorator (5.1.1-5) ... Selecting previously unselected package python3-defusedxml. Preparing to unpack .../365-python3-defusedxml_0.7.1-3_all.deb ... Unpacking python3-defusedxml (0.7.1-3) ... Selecting previously unselected package python3.13-doc. Preparing to unpack .../366-python3.13-doc_3.13.1-3_all.deb ... Unpacking python3.13-doc (3.13.1-3) ... Selecting previously unselected package python3-doc. Preparing to unpack .../367-python3-doc_3.13.1-2_all.deb ... Unpacking python3-doc (3.13.1-2) ... Selecting previously unselected package python3-roman. Preparing to unpack .../368-python3-roman_4.2-1_all.deb ... Unpacking python3-roman (4.2-1) ... Selecting previously unselected package python3-docutils. Preparing to unpack .../369-python3-docutils_0.21.2+dfsg-2_all.deb ... Unpacking python3-docutils (0.21.2+dfsg-2) ... Selecting previously unselected package python3-tz. Preparing to unpack .../370-python3-tz_2024.2-1_all.deb ... Unpacking python3-tz (2024.2-1) ... Selecting previously unselected package python3-platformdirs. Preparing to unpack .../371-python3-platformdirs_4.3.6-1_all.deb ... Unpacking python3-platformdirs (4.3.6-1) ... Selecting previously unselected package python3-fs. Preparing to unpack .../372-python3-fs_2.4.16-6_all.deb ... Unpacking python3-fs (2.4.16-6) ... Selecting previously unselected package python3-lxml:amd64. Preparing to unpack .../373-python3-lxml_5.3.0-1+b1_amd64.deb ... Unpacking python3-lxml:amd64 (5.3.0-1+b1) ... Selecting previously unselected package python3-lz4. Preparing to unpack .../374-python3-lz4_4.4.0+dfsg-1_amd64.deb ... Unpacking python3-lz4 (4.4.0+dfsg-1) ... Selecting previously unselected package python3-scipy. Preparing to unpack .../375-python3-scipy_1.14.1-3_amd64.deb ... Unpacking python3-scipy (1.14.1-3) ... Selecting previously unselected package python3-mpmath. Preparing to unpack .../376-python3-mpmath_1.3.0-1_all.deb ... Unpacking python3-mpmath (1.3.0-1) ... Selecting previously unselected package python3-sympy. Preparing to unpack .../377-python3-sympy_1.13.3-1_all.deb ... Unpacking python3-sympy (1.13.3-1) ... Selecting previously unselected package python3-ufolib2. Preparing to unpack .../378-python3-ufolib2_0.17.0+dfsg1-1_all.deb ... Unpacking python3-ufolib2 (0.17.0+dfsg1-1) ... Selecting previously unselected package python3-unicodedata2. Preparing to unpack .../379-python3-unicodedata2_15.1.0+ds-1+b3_amd64.deb ... Unpacking python3-unicodedata2 (15.1.0+ds-1+b3) ... Selecting previously unselected package unicode-data. Preparing to unpack .../380-unicode-data_15.1.0-1_all.deb ... Unpacking unicode-data (15.1.0-1) ... Selecting previously unselected package python3-fonttools. Preparing to unpack .../381-python3-fonttools_4.55.3-2_amd64.deb ... Unpacking python3-fonttools (4.55.3-2) ... Selecting previously unselected package python3-gi. Preparing to unpack .../382-python3-gi_3.50.0-4_amd64.deb ... Unpacking python3-gi (3.50.0-4) ... Selecting previously unselected package python3-idna. Preparing to unpack .../383-python3-idna_3.8-2_all.deb ... Unpacking python3-idna (3.8-2) ... Selecting previously unselected package python3-imagesize. Preparing to unpack .../384-python3-imagesize_1.4.1-1_all.deb ... Unpacking python3-imagesize (1.4.1-1) ... Selecting previously unselected package python3-markupsafe. Preparing to unpack .../385-python3-markupsafe_2.1.5-1+b2_amd64.deb ... Unpacking python3-markupsafe (2.1.5-1+b2) ... Selecting previously unselected package python3-jinja2. Preparing to unpack .../386-python3-jinja2_3.1.5-1_all.deb ... Unpacking python3-jinja2 (3.1.5-1) ... Selecting previously unselected package python3-kiwisolver. Preparing to unpack .../387-python3-kiwisolver_1.4.7-2+b1_amd64.deb ... Unpacking python3-kiwisolver (1.4.7-2+b1) ... Selecting previously unselected package python3-pil:amd64. Preparing to unpack .../388-python3-pil_11.1.0-1_amd64.deb ... Unpacking python3-pil:amd64 (11.1.0-1) ... Selecting previously unselected package python3.12-tk. Preparing to unpack .../389-python3.12-tk_3.12.8-5_amd64.deb ... Unpacking python3.12-tk (3.12.8-5) ... Selecting previously unselected package python3.13-tk. Preparing to unpack .../390-python3.13-tk_3.13.1-3_amd64.deb ... Unpacking python3.13-tk (3.13.1-3) ... Selecting previously unselected package python3-tk:amd64. Preparing to unpack .../391-python3-tk_3.13.1-1_amd64.deb ... Unpacking python3-tk:amd64 (3.13.1-1) ... Selecting previously unselected package python3-pil.imagetk:amd64. Preparing to unpack .../392-python3-pil.imagetk_11.1.0-1_amd64.deb ... Unpacking python3-pil.imagetk:amd64 (11.1.0-1) ... Selecting previously unselected package python3-pyparsing. Preparing to unpack .../393-python3-pyparsing_3.1.2-1_all.deb ... Unpacking python3-pyparsing (3.1.2-1) ... Selecting previously unselected package python3-matplotlib. Preparing to unpack .../394-python3-matplotlib_3.8.3-3+b1_amd64.deb ... Unpacking python3-matplotlib (3.8.3-3+b1) ... Selecting previously unselected package sphinx-common. Preparing to unpack .../395-sphinx-common_8.1.3-4_all.deb ... Unpacking sphinx-common (8.1.3-4) ... Selecting previously unselected package python3-pygments. Preparing to unpack .../396-python3-pygments_2.18.0+dfsg-2_all.deb ... Unpacking python3-pygments (2.18.0+dfsg-2) ... Selecting previously unselected package python3-urllib3. Preparing to unpack .../397-python3-urllib3_2.3.0-1_all.deb ... Unpacking python3-urllib3 (2.3.0-1) ... Selecting previously unselected package python3-requests. Preparing to unpack .../398-python3-requests_2.32.3+dfsg-1_all.deb ... Unpacking python3-requests (2.32.3+dfsg-1) ... Selecting previously unselected package python3-snowballstemmer. Preparing to unpack .../399-python3-snowballstemmer_2.2.0-4_all.deb ... Unpacking python3-snowballstemmer (2.2.0-4) ... Selecting previously unselected package python3-sphinx. Preparing to unpack .../400-python3-sphinx_8.1.3-4_all.deb ... Unpacking python3-sphinx (8.1.3-4) ... Selecting previously unselected package python3-tabulate. Preparing to unpack .../401-python3-tabulate_0.9.0-1_all.deb ... Unpacking python3-tabulate (0.9.0-1) ... Selecting previously unselected package python3-numpydoc. Preparing to unpack .../402-python3-numpydoc_1.8.0-1_all.deb ... Unpacking python3-numpydoc (1.8.0-1) ... Selecting previously unselected package texlive-fonts-recommended. Preparing to unpack .../403-texlive-fonts-recommended_2024.20250114-1_all.deb ... Unpacking texlive-fonts-recommended (2024.20250114-1) ... Selecting previously unselected package texlive-pictures. Preparing to unpack .../404-texlive-pictures_2024.20250114-1_all.deb ... Unpacking texlive-pictures (2024.20250114-1) ... Selecting previously unselected package texlive-latex-extra. Preparing to unpack .../405-texlive-latex-extra_2024.20250114-1_all.deb ... Unpacking texlive-latex-extra (2024.20250114-1) ... Selecting previously unselected package vpx-tools. Preparing to unpack .../406-vpx-tools_1.15.0-1_amd64.deb ... Unpacking vpx-tools (1.15.0-1) ... Selecting previously unselected package zstd. Preparing to unpack .../407-zstd_1.5.6+dfsg-2_amd64.deb ... Unpacking zstd (1.5.6+dfsg-2) ... Setting up media-types (10.1.0) ... Setting up libpipeline1:amd64 (1.5.8-1) ... Setting up libgraphite2-3:amd64 (1.3.14-2+b1) ... Setting up libboost-python1.83.0 (1.83.0-4) ... Setting up liblcms2-2:amd64 (2.16-2) ... Setting up libboost-program-options1.83.0:amd64 (1.83.0-4) ... Setting up libpixman-1-0:amd64 (0.44.0-3) ... Setting up libtext-charwidth-perl:amd64 (0.04-11+b4) ... Setting up libsharpyuv0:amd64 (1.5.0-0.1) ... Setting up systemd-sysv (257.2-2) ... Setting up libxau6:amd64 (1:1.0.11-1) ... Setting up libxdmcp6:amd64 (1:1.1.5-1) ... Setting up libnpth0t64:amd64 (1.8-2) ... Setting up libkeyutils1:amd64 (1.6.3-4) ... Setting up libboost1.83-dev:amd64 (1.83.0-4) ... Setting up libxcb1:amd64 (1.17.0-2+b1) ... Setting up fonts-lato (2.015-1) ... Setting up fonts-mathjax (2.7.9+dfsg-1) ... Setting up libpixman-1-dev:amd64 (0.44.0-3) ... Setting up native-architecture (0.2.3) ... Setting up libicu72:amd64 (72.1-6) ... Setting up liblerc4:amd64 (4.0.0+ds-5) ... Setting up bsdextrautils (2.40.4-1) ... Setting up hicolor-icon-theme (0.18-2) ... Setting up libjs-mathjax (2.7.9+dfsg-1) ... Setting up libboost-date-time1.83.0:amd64 (1.83.0-4) ... Setting up libgpg-error0:amd64 (1.51-3) ... Setting up libdatrie1:amd64 (0.2.13-3+b1) ... Setting up libmagic-mgc (1:5.45-3+b1) ... Setting up libxcb-render0:amd64 (1.17.0-2+b1) ... Setting up libarchive-zip-perl (1.68-1) ... Setting up fonts-lyx (2.4.3-1) ... Setting up libboost-regex1.83.0:amd64 (1.83.0-4) ... Setting up libdebhelper-perl (13.24.1) ... Setting up libbrotli1:amd64 (1.1.0-2+b6) ... Setting up libfontbox-java (1:1.8.16-5) ... Setting up libboost-system1.83.0:amd64 (1.83.0-4) ... Setting up libgdk-pixbuf2.0-common (2.42.12+dfsg-2) ... Setting up libboost-context1.83.0:amd64 (1.83.0-4) ... Setting up libmagic1t64:amd64 (1:5.45-3+b1) ... Setting up libboost-program-options1.83-dev:amd64 (1.83.0-4) ... Setting up x11-common (1:7.7+23.2) ... Running in chroot, ignoring request. Setting up X socket directories... /tmp/.X11-unix /tmp/.ICE-unix. Setting up libnghttp2-14:amd64 (1.64.0-1) ... Setting up libdeflate0:amd64 (1.23-1+b1) ... Setting up libboost-thread1.83.0:amd64 (1.83.0-4) ... Setting up gettext-base (0.23.1-1) ... Setting up m4 (1.4.19-5) ... Setting up libgcrypt20:amd64 (1.11.0-7) ... Setting up libqhull-r8.0:amd64 (2020.2-6+b2) ... Setting up xkb-data (2.42-1) ... Setting up liblzo2-2:amd64 (2.10-3+b1) ... Setting up autoconf-archive (20220903-3) ... Setting up libxcb-shm0:amd64 (1.17.0-2+b1) ... Setting up libcom-err2:amd64 (1.47.2-1) ... Setting up file (1:5.45-3+b1) ... Setting up fonts-open-sans (1.11-2) ... Setting up libsparsehash-dev (2.0.3-2) ... Setting up libtext-wrapi18n-perl (0.06-10) ... Setting up libjbig0:amd64 (2.1-6.1+b2) ... Setting up libpcre2-16-0:amd64 (10.44-5) ... Setting up libelf1t64:amd64 (0.192-4) ... Setting up python-babel-localedata (2.16.0-1) ... Setting up libkrb5support0:amd64 (1.21.3-4) ... Setting up libsasl2-modules-db:amd64 (2.1.28+dfsg1-8+b1) ... Setting up tzdata (2025a-1) ... Current default time zone: 'Etc/UTC' Local time is now: Wed Feb 25 07:41:23 UTC 2026. Universal Time is now: Wed Feb 25 07:41:23 UTC 2026. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up libboost-atomic1.83.0:amd64 (1.83.0-4) ... Setting up unicode-data (15.1.0-1) ... Setting up libsysprof-capture-4-dev:amd64 (47.2-1) ... Setting up libboost-serialization1.83.0:amd64 (1.83.0-4) ... Setting up xtrans-dev (1.4.0-1) ... Setting up autotools-dev (20220109.1) ... Setting up libpcre2-32-0:amd64 (10.44-5) ... Setting up libblas3:amd64 (3.12.0-4) ... update-alternatives: using /usr/lib/x86_64-linux-gnu/blas/libblas.so.3 to provide /usr/lib/x86_64-linux-gnu/libblas.so.3 (libblas.so.3-x86_64-linux-gnu) in auto mode Setting up libglib2.0-data (2.82.4-2) ... Setting up libpkgconf3:amd64 (1.8.1-4) ... Setting up libgmpxx4ldbl:amd64 (2:6.3.0+dfsg-3) ... Setting up libexpat1-dev:amd64 (2.6.4-1) ... Setting up libjpeg62-turbo:amd64 (1:2.1.5-3+b1) ... Setting up libzzip-0-13t64:amd64 (0.13.72+dfsg.1-1.3) ... Setting up libboost-program-options-dev:amd64 (1.83.0.2+b2) ... Setting up libx11-data (2:1.8.10-2) ... Setting up libepoxy0:amd64 (1.5.10-2) ... Setting up libnspr4:amd64 (2:4.36-1) ... Setting up libboost-chrono1.83.0t64:amd64 (1.83.0-4) ... Setting up gnupg-l10n (2.2.46-1) ... Setting up libteckit0:amd64 (2.5.12+ds1-1+b1) ... Setting up uuid-dev:amd64 (2.40.4-1) ... Setting up libapache-pom-java (33-2) ... Setting up libavahi-common-data:amd64 (0.8-16) ... Setting up libdbus-1-3:amd64 (1.16.0-1) ... Setting up libfribidi0:amd64 (1.0.16-1) ... Setting up t1utils (1.41-4) ... Setting up libtexlua53-5:amd64 (2024.20240313.70630+ds-5+b1) ... Setting up libimagequant0:amd64 (2.18.0-1+b2) ... Setting up libproc2-0:amd64 (2:4.0.4-6) ... Setting up libunistring5:amd64 (1.3-1) ... Setting up fonts-dejavu-mono (2.37-8) ... Setting up libpng16-16t64:amd64 (1.6.45-1) ... Setting up libtcl8.6:amd64 (8.6.16+dfsg-1) ... Setting up autopoint (0.23.1-1) ... Setting up libmpfi0:amd64 (1.5.4+ds-4) ... Setting up icu-devtools (72.1-6) ... Setting up fonts-dejavu-core (2.37-8) ... Setting up libsepol-dev:amd64 (3.7-1) ... Setting up pkgconf-bin (1.8.1-4) ... Setting up libk5crypto3:amd64 (1.21.3-4) ... Setting up libboost-test1.83.0:amd64 (1.83.0-4) ... Setting up libkpathsea6:amd64 (2024.20240313.70630+ds-5+b1) ... Setting up libsasl2-2:amd64 (2.1.28+dfsg1-8+b1) ... Setting up libgfortran5:amd64 (14.2.0-14) ... Setting up libboost-atomic1.83-dev:amd64 (1.83.0-4) ... Setting up autoconf (2.72-3) ... Setting up libnghttp3-9:amd64 (1.6.0-2) ... Setting up libwebp7:amd64 (1.5.0-0.1) ... Setting up zlib1g-dev:amd64 (1:1.3.dfsg+really1.3.1-1+b1) ... Setting up libffi8:amd64 (3.4.6-1) ... Setting up libpcre2-posix3:amd64 (10.44-5) ... Setting up libvpx9:amd64 (1.15.0-1) ... Setting up dwz (0.15-1+b1) ... Setting up libdav1d7:amd64 (1.5.0-1+b1) ... Setting up sensible-utils (0.0.24) ... Setting up at-spi2-common (2.55.0.1-1) ... Setting up libtiff6:amd64 (4.5.1+git230720-5) ... Setting up dbus-session-bus-common (1.16.0-1) ... Setting up libuchardet0:amd64 (0.0.8-1+b2) ... Setting up libassuan9:amd64 (3.0.1-2) ... Setting up procps (2:4.0.4-6) ... Setting up libjson-perl (4.10000-1) ... Setting up libboost-graph1.83.0:amd64 (1.83.0-4) ... Setting up libtasn1-6:amd64 (4.19.0-3+b3) ... Setting up fonts-lmodern (2.005-1) ... Setting up libopenjp2-7:amd64 (2.5.0-2+b4) ... Setting up libx11-6:amd64 (2:1.8.10-2) ... Setting up libthai-data (0.1.29-2) ... Setting up xorg-sgml-doctools (1:1.11-1.1) ... Setting up netbase (6.4) ... Setting up libngtcp2-16:amd64 (1.9.1-1) ... Setting up sgml-base (1.31) ... Setting up libkrb5-3:amd64 (1.21.3-4) ... Setting up libboost-dev:amd64 (1.83.0.2+b2) ... Setting up libwayland-egl1:amd64 (1.23.0-1+b1) ... Setting up libboost-system1.83-dev:amd64 (1.83.0-4) ... Setting up libpaper2:amd64 (2.2.5-0.3) ... Setting up libssh2-1t64:amd64 (1.11.1-1) ... Setting up libjs-jquery (3.6.1+dfsg+~3.5.14-1) ... Setting up dbus-system-bus-common (1.16.0-1) ... useradd: Warning: missing or non-executable shell '/usr/sbin/nologin' Setting up python-matplotlib-data (3.8.3-3) ... Setting up openssl (3.4.0-2) ... Setting up libwebpmux3:amd64 (1.5.0-0.1) ... Setting up libxcomposite1:amd64 (1:0.4.6-1) ... Setting up readline-common (8.2-6) ... Setting up libicu-dev:amd64 (72.1-6) ... Setting up libxml2:amd64 (2.12.7+dfsg+really2.9.14-0.2+b1) ... Setting up fonts-font-awesome (5.0.10+really4.7.0~dfsg-4.1) ... Setting up sphinx-rtd-theme-common (3.0.2+dfsg-2) ... Setting up xdg-utils (1.2.1-2) ... update-alternatives: using /usr/bin/xdg-open to provide /usr/bin/open (open) in auto mode Setting up zstd (1.5.6+dfsg-2) ... Setting up libldap2:amd64 (2.6.9+dfsg-1) ... Setting up dbus-bin (1.16.0-1) ... Setting up libbrotli-dev:amd64 (1.1.0-2+b6) ... Setting up libsynctex2:amd64 (2024.20240313.70630+ds-5+b1) ... Setting up libjs-underscore (1.13.4~dfsg+~1.11.4-3) ... Setting up libbz2-dev:amd64 (1.0.8-6) ... Setting up libxkbcommon0:amd64 (1.7.0-2) ... Setting up libpotrace0:amd64 (1.16-2+b2) ... Setting up libwayland-client0:amd64 (1.23.0-1+b1) ... Setting up automake (1:1.16.5-1.3) ... update-alternatives: using /usr/bin/automake-1.16 to provide /usr/bin/automake (automake) in auto mode Setting up libksba8:amd64 (1.6.7-2+b1) ... Setting up pinentry-curses (1.3.1-2) ... Setting up x11proto-dev (2024.1-1) ... Setting up libfile-stripnondeterminism-perl (1.14.1-1) ... Setting up libblkid-dev:amd64 (2.40.4-1) ... Setting up libice6:amd64 (2:1.1.1-1) ... Setting up liblapack3:amd64 (3.12.0-4) ... update-alternatives: using /usr/lib/x86_64-linux-gnu/lapack/liblapack.so.3 to provide /usr/lib/x86_64-linux-gnu/liblapack.so.3 (liblapack.so.3-x86_64-linux-gnu) in auto mode Setting up gettext (0.23.1-1) ... Setting up libboost-coroutine1.83.0:amd64 (1.83.0-4) ... Setting up libxdamage1:amd64 (1:1.1.6-1+b2) ... Setting up libgmp-dev:amd64 (2:6.3.0+dfsg-3) ... Setting up libpdfbox-java (1:1.8.16-5) ... Setting up libxau-dev:amd64 (1:1.0.11-1) ... Setting up libboost-chrono1.83-dev:amd64 (1.83.0-4) ... Setting up libxpm4:amd64 (1:3.5.17-1+b3) ... Setting up libpcre2-dev:amd64 (10.44-5) ... Setting up libxrender1:amd64 (1:0.9.10-1.1+b3) ... Setting up libice-dev:amd64 (2:1.1.1-1) ... Setting up libtool (2.5.4-2) ... Setting up libselinux1-dev:amd64 (3.7-3+b1) ... Setting up fontconfig-config (2.15.0-2) ... Setting up libwebpdemux2:amd64 (1.5.0-0.1) ... Setting up libboost-system-dev:amd64 (1.83.0.2+b2) ... Setting up libpng-dev:amd64 (1.6.45-1) ... Setting up libcommons-parent-java (56-1) ... Setting up libavahi-common3:amd64 (0.8-16) ... Setting up libboost-serialization1.83-dev:amd64 (1.83.0-4) ... Setting up libcommons-logging-java (1.3.0-1) ... Setting up libxext6:amd64 (2:1.3.4-1+b3) ... Setting up libboost-test1.83-dev:amd64 (1.83.0-4) ... Setting up libidn2-0:amd64 (2.3.7-2+b1) ... Setting up libnss3:amd64 (2:3.107-1) ... Setting up dbus-daemon (1.16.0-1) ... Setting up libpaper-utils (2.2.5-0.3) ... Setting up libffi-dev:amd64 (3.4.6-1) ... Setting up libmpfr-dev:amd64 (4.2.1-1+b2) ... Setting up pkgconf:amd64 (1.8.1-4) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up dh-autoreconf (20) ... Setting up libsigc++-2.0-dev:amd64 (2.12.1-3) ... Setting up python3.13-doc (3.13.1-3) ... Setting up libthai0:amd64 (0.1.29-2+b1) ... Setting up ca-certificates (20241223) ... Updating certificates in /etc/ssl/certs... 152 added, 0 removed; done. Setting up libxdmcp-dev:amd64 (1:1.1.5-1) ... Setting up libglib2.0-0t64:amd64 (2.82.4-2) ... Setting up libjs-jquery-ui (1.13.2+dfsg-1) ... Setting up libptexenc1:amd64 (2024.20240313.70630+ds-5+b1) ... Setting up libfreetype6:amd64 (2.13.3+dfsg-1) ... Setting up libxfixes3:amd64 (1:6.0.0-2+b3) ... Setting up libboost-date-time1.83-dev:amd64 (1.83.0-4) ... Setting up x11proto-core-dev (2024.1-1) ... Setting up dbus (1.16.0-1) ... Running in chroot, ignoring request. invoke-rc.d: policy-rc.d denied execution of start. Setting up shared-mime-info (2.4-5+b1) ... Setting up libp11-kit0:amd64 (0.25.5-3) ... Setting up libxinerama1:amd64 (2:1.1.4-3+b3) ... Setting up libgssapi-krb5-2:amd64 (1.21.3-4) ... Setting up libxrandr2:amd64 (2:1.5.4-1+b2) ... Setting up libboost-regex1.83-dev:amd64 (1.83.0-4) ... Setting up ucf (3.0048) ... Setting up gir1.2-glib-2.0:amd64 (2.82.4-2) ... Setting up vpx-tools (1.15.0-1) ... Setting up libjs-sphinxdoc (8.1.3-4) ... Setting up libreadline8t64:amd64 (8.2-6) ... Setting up dh-strip-nondeterminism (1.14.1-1) ... Setting up groff-base (1.23.0-7) ... Setting up libwayland-cursor0:amd64 (1.23.0-1+b1) ... Setting up xml-core (0.19) ... Setting up libxslt1.1:amd64 (1.1.35-1.1+b1) ... Setting up gpgconf (2.2.46-1+b1) ... Setting up libpam-systemd:amd64 (257.2-2) ... Setting up libharfbuzz0b:amd64 (10.2.0-1) ... Setting up libgirepository-1.0-1:amd64 (1.82.0-4) ... Setting up libgdk-pixbuf-2.0-0:amd64 (2.42.12+dfsg-2) ... Setting up python-mpltoolkits.basemap-doc (1.2.2+dfsg-5) ... Setting up libxss1:amd64 (1:1.2.3-1+b3) ... Setting up libfontconfig1:amd64 (2.15.0-2) ... Setting up libboost-regex-dev:amd64 (1.83.0.2+b2) ... Setting up libsm6:amd64 (2:1.2.4-1) ... Setting up libpython3.13-stdlib:amd64 (3.13.1-3) ... Setting up libavahi-client3:amd64 (0.8-16) ... Setting up libmount-dev:amd64 (2.40.4-1) ... Setting up python3-doc (3.13.1-2) ... Setting up gpg (2.2.46-1+b1) ... Setting up libpython3-stdlib:amd64 (3.13.1-2) ... Setting up liblbfgsb0:amd64 (3.0+dfsg.4-1+b2) ... Setting up python3-cairo-doc (1.26.1-2) ... Setting up libpython3.13:amd64 (3.13.1-3) ... Setting up libgnutls30t64:amd64 (3.8.8-2) ... Setting up libboost-thread1.83-dev:amd64 (1.83.0-4) ... Setting up gtk-update-icon-cache (4.16.12+ds-1) ... Setting up fontconfig (2.15.0-2) ... Regenerating fonts cache... done. Setting up libxft2:amd64 (2.3.6-1+b3) ... Setting up libgio-2.0-dev:amd64 (2.82.4-2) ... Setting up gpg-agent (2.2.46-1+b1) ... Created symlink '/etc/systemd/user/sockets.target.wants/gpg-agent-browser.socket' -> '/usr/lib/systemd/user/gpg-agent-browser.socket'. Created symlink '/etc/systemd/user/sockets.target.wants/gpg-agent-extra.socket' -> '/usr/lib/systemd/user/gpg-agent-extra.socket'. Created symlink '/etc/systemd/user/sockets.target.wants/gpg-agent-ssh.socket' -> '/usr/lib/systemd/user/gpg-agent-ssh.socket'. Created symlink '/etc/systemd/user/sockets.target.wants/gpg-agent.socket' -> '/usr/lib/systemd/user/gpg-agent.socket'. Setting up libxcb1-dev:amd64 (1.17.0-2+b1) ... Setting up libatk1.0-0t64:amd64 (2.55.0.1-1) ... Setting up libxi6:amd64 (2:1.8.2-1) ... Setting up gir1.2-gdkpixbuf-2.0:amd64 (2.42.12+dfsg-2) ... Setting up python-pandas-doc (2.2.3+dfsg-5) ... Setting up python3.13 (3.13.1-3) ... Setting up libgirepository-2.0-0:amd64 (2.82.4-2) ... Setting up gir1.2-atk-1.0:amd64 (2.55.0.1-1) ... Setting up python-ipython-doc (8.30.0-2) ... Setting up libsm-dev:amd64 (2:1.2.4-1) ... Setting up libboost-iostreams1.83-dev:amd64 (1.83.0-4) ... Setting up po-debconf (1.0.21+nmu1) ... Setting up libtk8.6:amd64 (8.6.16-1) ... Setting up libxcursor1:amd64 (1:1.2.3-1) ... Setting up gpgsm (2.2.46-1+b1) ... Setting up libpango-1.0-0:amd64 (1.56.1-1) ... Setting up python3.12-tk (3.12.8-5) ... Setting up libpsl5t64:amd64 (0.21.2-1.1+b1) ... Setting up libx11-dev:amd64 (2:1.8.10-2) ... Setting up libcloudproviders0:amd64 (0.3.6-1+b1) ... Setting up libglib2.0-bin (2.82.4-2) ... Setting up python3 (3.13.1-2) ... Setting up libharfbuzz-gobject0:amd64 (10.2.0-1) ... Setting up libboost-iostreams-dev:amd64 (1.83.0.2+b2) ... Setting up python3-zipp (3.21.0-1) ... Setting up python3-autocommand (2.2.2-3) ... Setting up man-db (2.13.0-1) ... Not building database; man-db/auto-update is not 'true'. Created symlink '/etc/systemd/system/timers.target.wants/man-db.timer' -> '/usr/lib/systemd/system/man-db.timer'. Setting up python3-markupsafe (2.1.5-1+b2) ... Setting up libboost-graph1.83-dev:amd64 (1.83.0-4) ... Setting up libcairo2:amd64 (1.18.2-2) ... Setting up python3.13-tk (3.13.1-3) ... Setting up libcolord2:amd64 (1.4.7-1+b2) ... Setting up python3-platformdirs (4.3.6-1) ... Setting up python3-tz (2024.2-1) ... Setting up libfreetype-dev:amd64 (2.13.3+dfsg-1) ... Setting up libboost-context1.83-dev:amd64 (1.83.0-4) ... Setting up python3-fs (2.4.16-6) ... Setting up libcairomm-1.0-1v5:amd64 (1.14.5-2+b1) ... Setting up libdconf1:amd64 (0.40.0-5) ... Setting up tex-common (6.18) ... update-language: texlive-base not installed and configured, doing nothing! Setting up libboost-coroutine1.83-dev:amd64 (1.83.0-4) ... Setting up dirmngr (2.2.46-1+b1) ... Created symlink '/etc/systemd/user/sockets.target.wants/dirmngr.socket' -> '/usr/lib/systemd/user/dirmngr.socket'. Setting up libxcb-shm0-dev:amd64 (1.17.0-2+b1) ... Setting up dbus-user-session (1.16.0-1) ... Setting up python3-roman (4.2-1) ... Setting up python3-decorator (5.1.1-5) ... Setting up python3-jinja2 (3.1.5-1) ... Setting up python3-pygments (2.18.0+dfsg-2) ... Setting up python3-packaging (24.2-1) ... Setting up python3-chardet (5.2.0+dfsg-2) ... Setting up python3-pyparsing (3.1.2-1) ... Setting up adwaita-icon-theme (47.0-2) ... update-alternatives: using /usr/share/icons/Adwaita/cursor.theme to provide /usr/share/icons/default/index.theme (x-cursor-theme) in auto mode Setting up python3-certifi (2024.12.14+ds-1) ... Setting up librtmp1:amd64 (2.4+20151223.gitfa8646d.1-2+b5) ... Setting up gir1.2-girepository-2.0:amd64 (1.82.0-4) ... Setting up python3-snowballstemmer (2.2.0-4) ... Setting up python3-brotli (1.1.0-2+b6) ... Setting up libatspi2.0-0t64:amd64 (2.55.0.1-1) ... Setting up libraqm0:amd64 (0.10.2-1) ... Setting up libpython3.13-dev:amd64 (3.13.1-3) ... Setting up sphinx-common (8.1.3-4) ... Setting up python-scipy-doc (1.14.1-3) ... Setting up python3-gi (3.50.0-4) ... Setting up python3-cycler (0.12.1-1) ... Setting up libxt6t64:amd64 (1:1.2.1-1.2+b2) ... Setting up python3-kiwisolver (1.4.7-2+b1) ... Setting up python3-idna (3.8-2) ... Setting up python3-typing-extensions (4.12.2-2) ... Setting up libxcb-render0-dev:amd64 (1.17.0-2+b1) ... Setting up python3-numpy (1:1.26.4+ds-13) ... Setting up python3-urllib3 (2.3.0-1) ... Setting up libxext-dev:amd64 (2:1.3.4-1+b3) ... Setting up python3-lxml:amd64 (5.3.0-1+b1) ... Setting up gnupg (2.2.46-1) ... Setting up python3-dateutil (2.9.0-3) ... Setting up python3-contourpy (1.3.1-1) ... Setting up libcairo-gobject2:amd64 (1.18.2-2) ... Setting up libboost-coroutine-dev:amd64 (1.83.0.2+b2) ... Setting up libgpgme11t64:amd64 (1.24.1-2) ... Setting up libpangoft2-1.0-0:amd64 (1.56.1-1) ... Setting up python3-mpmath (1.3.0-1) ... Setting up libxrender-dev:amd64 (1:0.9.10-1.1+b3) ... Setting up libcups2t64:amd64 (2.4.10-2+b1) ... Setting up libngtcp2-crypto-gnutls8:amd64 (1.9.1-1) ... Setting up libboost-thread-dev:amd64 (1.83.0.2+b2) ... Setting up libpangocairo-1.0-0:amd64 (1.56.1-1) ... Setting up python3-imagesize (1.4.1-1) ... Setting up libcairo-script-interpreter2:amd64 (1.18.2-2) ... Setting up libatk-bridge2.0-0t64:amd64 (2.55.0.1-1) ... Setting up python3-more-itertools (10.6.0-1) ... Setting up python3-sympy (1.13.3-1) ... Setting up python3-attr (24.3.0-1) ... Setting up libgpgmepp6t64:amd64 (1.24.1-2) ... Setting up libboost-graph-dev:amd64 (1.83.0.2+b2) ... Setting up tk8.6-blt2.5 (2.5.3+dfsg-7) ... Setting up libgio-2.0-dev-bin (2.82.4-2) ... Setting up libxmu6:amd64 (2:1.1.3-3+b4) ... Setting up gir1.2-freedesktop:amd64 (1.82.0-4) ... Setting up girepository-tools:amd64 (2.82.4-2) ... Setting up python3-scipy (1.14.1-3) ... Setting up libpython3-dev:amd64 (3.13.1-2) ... Setting up python3-cairo (1.26.1-2+b1) ... Setting up python3-jaraco.functools (4.1.0-1) ... Setting up libpangoxft-1.0-0:amd64 (1.56.1-1) ... Setting up python3-jaraco.context (6.0.0-1) ... Setting up python3-lz4 (4.4.0+dfsg-1) ... Setting up libfontconfig-dev:amd64 (2.15.0-2) ... Setting up python3-defusedxml (0.7.1-3) ... Setting up python3-charset-normalizer (3.4.0-1+b1) ... Setting up python3.13-dev (3.13.1-3) ... Setting up python3-alabaster (0.7.16-0.1) ... Setting up python3-unicodedata2 (15.1.0+ds-1+b3) ... Setting up blt (2.5.3+dfsg-7) ... Setting up preview-latex-style (13.2-1) ... Setting up python3-typeguard (4.4.1-1) ... Setting up libcurl3t64-gnutls:amd64 (8.11.1-1+b1) ... Setting up python3-tabulate (0.9.0-1) ... Setting up python3-tk:amd64 (3.13.1-1) ... Setting up debhelper (13.24.1) ... Setting up dconf-service (0.40.0-5) ... Setting up libxaw7:amd64 (2:1.0.16-1) ... Setting up gir1.2-harfbuzz-0.0:amd64 (10.2.0-1) ... Setting up libcgal-dev:amd64 (6.0.1-1) ... Setting up librsvg2-2:amd64 (2.59.2+dfsg-1) ... Setting up python3-pil:amd64 (11.1.0-1) ... Setting up python3-inflect (7.3.1-2) ... Setting up gir1.2-pango-1.0:amd64 (1.56.1-1) ... Setting up python3-pil.imagetk:amd64 (11.1.0-1) ... Setting up python3-jaraco.text (4.0.0-1) ... Setting up python3-dev (3.13.1-2) ... Setting up python3-requests (2.32.3+dfsg-1) ... Setting up libboost-python1.83-dev (1.83.0-4) ... Setting up librsvg2-common:amd64 (2.59.2+dfsg-1) ... Setting up texlive-binaries (2024.20240313.70630+ds-5+b1) ... update-alternatives: using /usr/bin/xdvi-xaw to provide /usr/bin/xdvi.bin (xdvi.bin) in auto mode update-alternatives: using /usr/bin/bibtex.original to provide /usr/bin/bibtex (bibtex) in auto mode Setting up python3-cairo-dev (1.26.1-2) ... Setting up libpoppler140:amd64 (24.08.0-4) ... Setting up poppler-utils (24.08.0-4) ... Setting up texlive-base (2024.20250114-1) ... tl-paper: setting paper size for dvips to a4: /var/lib/texmf/dvips/config/config-paper.ps tl-paper: setting paper size for dvipdfmx to a4: /var/lib/texmf/dvipdfmx/dvipdfmx-paper.cfg tl-paper: setting paper size for xdvi to a4: /var/lib/texmf/xdvi/XDvi-paper tl-paper: setting paper size for pdftex to a4: /var/lib/texmf/tex/generic/tex-ini-files/pdftexconfig.tex Setting up python3-pkg-resources (75.6.0-1) ... Setting up libglib2.0-dev-bin (2.82.4-2) ... Setting up python3-setuptools (75.6.0-1) ... Setting up dconf-gsettings-backend:amd64 (0.40.0-5) ... Setting up python3-babel (2.16.0-1) ... update-alternatives: using /usr/bin/pybabel-python3 to provide /usr/bin/pybabel (pybabel) in auto mode Setting up libboost-python-dev (1.83.0.2+b2) ... Setting up libglib2.0-dev:amd64 (2.82.4-2) ... Setting up texlive-latex-base (2024.20250114-1) ... Setting up texlive-latex-recommended (2024.20250114-1) ... Setting up texlive-pictures (2024.20250114-1) ... Setting up texlive-fonts-recommended (2024.20250114-1) ... Setting up libcairo2-dev:amd64 (1.18.2-2) ... Setting up libgtk-3-common (3.24.43-5) ... Setting up cm-super-minimal (0.3.4-17) ... Setting up dh-python (6.20250108) ... Setting up latexmk (1:4.86~ds-1) ... Setting up texlive-latex-extra (2024.20250114-1) ... Setting up libcairomm-1.0-dev:amd64 (1.14.5-2+b1) ... Setting up libgtk-3-0t64:amd64 (3.24.43-5) ... Setting up gir1.2-gtk-3.0:amd64 (3.24.43-5) ... Setting up python3-ufolib2 (0.17.0+dfsg1-1) ... Setting up python3-fonttools (4.55.3-2) ... Setting up python3-matplotlib (3.8.3-3+b1) ... Processing triggers for libc-bin (2.40-5) ... Processing triggers for systemd (257.2-2) ... Processing triggers for sgml-base (1.31) ... Setting up docutils-common (0.21.2+dfsg-2) ... Processing triggers for sgml-base (1.31) ... Setting up python3-docutils (0.21.2+dfsg-2) ... Setting up python3-sphinx (8.1.3-4) ... Setting up python3-numpydoc (1.8.0-1) ... Processing triggers for ca-certificates (20241223) ... Updating certificates in /etc/ssl/certs... 0 added, 0 removed; done. Running hooks in /etc/ca-certificates/update.d... done. Processing triggers for libgdk-pixbuf-2.0-0:amd64 (2.42.12+dfsg-2) ... Processing triggers for tex-common (6.18) ... Running updmap-sys. This may take some time... done. Running mktexlsr /var/lib/texmf ... done. Building format(s) --all. This may take some time... done. Reading package lists... Building dependency tree... Reading state information... Reading extended state information... Initializing package states... Writing extended state information... Building tag database... -> Finished parsing the build-deps I: Building the package I: Running cd /build/reproducible-path/graph-tool-2.77+ds/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-genchanges -S > ../graph-tool_2.77+ds-3_source.changes dpkg-buildpackage: info: source package graph-tool dpkg-buildpackage: info: source version 2.77+ds-3 dpkg-buildpackage: info: source distribution unstable dpkg-buildpackage: info: source changed by Santiago Vila dpkg-source --before-build . dpkg-buildpackage: info: host architecture amd64 debian/rules clean dh clean --with python3 --builddirectory=_BUILD dh_auto_clean -O--builddirectory=_BUILD dh_autoreconf_clean -O--builddirectory=_BUILD debian/rules override_dh_clean make[1]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds' find debian/adhoc/provide/doc/ -type f | sed 's@debian/adhoc/provide/@@g' | xargs rm -vf dh_clean rm -f debian/debhelper-build-stamp rm -rf debian/.debhelper/ rm -f -- debian/python3-graph-tool.substvars debian/graph-tool-doc.substvars debian/files rm -fr -- debian/python3-graph-tool/ debian/tmp/ debian/graph-tool-doc/ find . \( \( \ \( -path .\*/.git -o -path .\*/.svn -o -path .\*/.bzr -o -path .\*/.hg -o -path .\*/CVS -o -path .\*/.pc -o -path .\*/_darcs \) -prune -o -type f -a \ \( -name '#*#' -o -name '.*~' -o -name '*~' -o -name DEADJOE \ -o -name '*.orig' -o -name '*.rej' -o -name '*.bak' \ -o -name '.*.orig' -o -name .*.rej -o -name '.SUMS' \ -o -name TAGS -o \( -path '*/.deps/*' -a -name '*.P' \) \ \) -exec rm -f {} + \) -o \ \( -type d -a \( -name autom4te.cache -o -name __pycache__ \) -prune -exec rm -rf {} + \) \) make[1]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds' debian/rules binary dh binary --with python3 --builddirectory=_BUILD dh_update_autotools_config -O--builddirectory=_BUILD dh_autoreconf -O--builddirectory=_BUILD find ! -ipath "./debian/*" -a ! \( -path '*/.git/*' -o -path '*/.hg/*' -o -path '*/.bzr/*' -o -path '*/.svn/*' -o -path '*/CVS/*' \) -a -type f -exec md5sum {} + -o -type l -printf "symlink %p " > debian/autoreconf.before grep -q ^XDT_ configure.ac autoreconf -f -i libtoolize: putting auxiliary files in AC_CONFIG_AUX_DIR, 'build-aux'. libtoolize: copying file 'build-aux/ltmain.sh' libtoolize: putting macros in AC_CONFIG_MACRO_DIRS, 'm4'. libtoolize: copying file 'm4/libtool.m4' libtoolize: copying file 'm4/ltoptions.m4' libtoolize: copying file 'm4/ltsugar.m4' libtoolize: copying file 'm4/ltversion.m4' libtoolize: copying file 'm4/lt~obsolete.m4' libtoolize: Consider adding '-I m4' to ACLOCAL_AMFLAGS in Makefile.am. configure.ac:26: installing 'build-aux/compile' configure.ac:21: installing 'build-aux/config.guess' configure.ac:21: installing 'build-aux/config.sub' configure.ac:22: installing 'build-aux/install-sh' configure.ac:22: installing 'build-aux/missing' Makefile.am: installing 'build-aux/depcomp' Makefile.am:787: installing 'build-aux/py-compile' find ! -ipath "./debian/*" -a ! \( -path '*/.git/*' -o -path '*/.hg/*' -o -path '*/.bzr/*' -o -path '*/.svn/*' -o -path '*/CVS/*' \) -a -type f -exec md5sum {} + -o -type l -printf "symlink %p " > debian/autoreconf.after debian/rules override_dh_auto_configure make[1]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds' ## see d/patches/upstream-fix-autotools-automake-doc-missing.patch cp -vprd -t doc debian/adhoc/provide/doc/* 'debian/adhoc/provide/doc/demos/animation/animation_dancing.py' -> 'doc/demos/animation/animation_dancing.py' 'debian/adhoc/provide/doc/demos/animation/animation_sirs.py' -> 'doc/demos/animation/animation_sirs.py' 'debian/adhoc/provide/doc/demos/animation/animation_zombies.py' -> 'doc/demos/animation/animation_zombies.py' 'debian/adhoc/provide/doc/demos/animation/face-grin.png' -> 'doc/demos/animation/face-grin.png' 'debian/adhoc/provide/doc/demos/animation/face-surprise.png' -> 'doc/demos/animation/face-surprise.png' 'debian/adhoc/provide/doc/demos/animation/interactive_bst.py' -> 'doc/demos/animation/interactive_bst.py' 'debian/adhoc/provide/doc/demos/animation/zombie.png' -> 'doc/demos/animation/zombie.png' 'debian/adhoc/provide/doc/demos/inference/blockmodel-example.gt.gz' -> 'doc/demos/inference/blockmodel-example.gt.gz' 'debian/adhoc/provide/doc/demos/inference/nested-diagram.svg' -> 'doc/demos/inference/nested-diagram.svg' 'debian/adhoc/provide/doc/demos/matplotlib' -> 'doc/demos/matplotlib' 'debian/adhoc/provide/doc/demos/matplotlib/matplotlib.rst' -> 'doc/demos/matplotlib/matplotlib.rst' 'debian/adhoc/provide/doc/extlinks_fancy.py' -> 'doc/extlinks_fancy.py' 'debian/adhoc/provide/doc/mincut-example.xml.gz' -> 'doc/mincut-example.xml.gz' 'debian/adhoc/provide/doc/mincut-st-example.xml.gz' -> 'doc/mincut-st-example.xml.gz' PYTHON_VERSION=3.13 \ PYTHON_SITE_PKG=/usr/lib/python3.13/dist-packages \ dh_auto_configure -- \ --with-sparsehash-prefix=google \ --with-boost-python=boost_python313 cd _BUILD && ../configure --build=x86_64-linux-gnu --prefix=/usr --includedir=\${prefix}/include --mandir=\${prefix}/share/man --infodir=\${prefix}/share/info --sysconfdir=/etc --localstatedir=/var --disable-option-checking --disable-silent-rules --libdir=\${prefix}/lib/x86_64-linux-gnu --runstatedir=/run --disable-maintainer-mode --disable-dependency-tracking --with-sparsehash-prefix=google --with-boost-python=boost_python313 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... no checking for mawk... mawk checking whether make sets $(MAKE)... yes checking whether make supports nested variables... yes checking how to create a pax tar archive... gnutar checking whether make supports nested variables... (cached) yes checking whether make supports the include directive... yes (GNU style) 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 gcc understands -c and -o together... yes checking dependency style of gcc... none 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 wchar.h... yes checking for minix/config.h... no checking whether it is safe to define __EXTENSIONS__... yes checking whether _XOPEN_SOURCE should be defined... no checking for library containing strerror... none required checking for g++... g++ checking whether the compiler supports GNU C++... yes checking whether g++ accepts -g... yes checking for g++ option to enable C++11 features... none needed checking dependency style of g++... none checking how to print strings... printf checking for a sed that does not truncate output... /usr/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 how to convert x86_64-pc-linux-gnu file names to x86_64-pc-linux-gnu format... func_convert_file_noop checking how to convert x86_64-pc-linux-gnu file names to toolchain format... func_convert_file_noop checking for /usr/bin/ld option to reload object files... -r checking for file... file 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 ranlib... ranlib checking for ar... ar checking for archiver @FILE support... @ checking for strip... strip 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... no checking if : is a manifest tool... no 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 whether -lc should be explicitly linked in... no checking dynamic linker characteristics... GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking whether stripping libraries is possible... yes checking if libtool supports shared libraries... yes checking whether to build shared libraries... yes checking whether to build static libraries... no checking how to run the C++ preprocessor... g++ -E checking for ld used by g++... /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++ linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking for g++ option to produce PIC... -fPIC -DPIC checking if g++ PIC flag -fPIC -DPIC works... yes checking if g++ static flag -static works... yes checking if g++ supports -c -o file.o... yes checking if g++ supports -c -o file.o... (cached) yes checking whether the g++ 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 for pkg-config... /usr/bin/pkg-config checking pkg-config is at least version 0.9.0... yes checking whether g++ supports C++17 features with -std=gnu++17... yes checking whether to enable debug info... no checking whether to enable parallel algorithms with openmp... checking for OpenMP flag of C++ compiler... -fopenmp checking whether to enable cairo drawing... yes checking for expat... yes checking for a Python interpreter with version >= 3.6... python3 checking for python3... /usr/bin/python3 checking for python3 version... 3.13 checking for python3 platform... linux checking for GNU default python3 prefix... ${prefix} checking for GNU default python3 exec_prefix... ${exec_prefix} checking for python3 script directory (pythondir)... ${PYTHON_PREFIX}/lib/python3.13/site-packages checking for python3 extension module directory (pyexecdir)... ${PYTHON_EXEC_PREFIX}/lib/python3.13/site-packages checking for python3.13... (cached) /usr/bin/python3 checking for a version of Python >= '2.1.0'... yes checking for a version of Python == '3.13.1'... yes checking for the sysconfig Python package... yes checking for Python include path... -I/usr/include/python3.13 checking for Python library path... -L/usr/lib/x86_64-linux-gnu -lpython3.13 checking for Python site-packages path... /usr/lib/python3.13/dist-packages checking for Python platform specific site-packages path... /usr/lib/python3.13/site-packages checking python extra libraries... -ldl -lm checking python extra linking flags... -Xlinker -export-dynamic -Wl,-O1 -Wl,-Bsymbolic-functions checking consistency of all components of python development environment... yes checking for boostlib >= 1.58.0 (105800)... yes checking whether the Boost::Python library is available... yes checking whether boost_python313 is the correct library... yes checking whether the Boost::IOStreams library is available... yes checking for exit in -lboost_iostreams... yes checking whether the Boost::Regex library is available... yes checking for exit in -lboost_regex... yes checking whether the Boost::Context library is available... yes checking for exit in -lboost_context... yes checking whether the Boost::Coroutine library is available... yes checking for exit in -lboost_coroutine... yes checking whether the Boost::Graph library is available... yes checking for exit in -lboost_graph... yes checking whether the Boost::Thread library is available... yes checking for exit in -lboost_thread... yes checking for __gmpz_init in -lgmp... yes checking for __gmpz_init in -lgmp... (cached) yes checking whether CGAL is available in /usr... yes checking whether to enable debbuging with valgrind... no checking python3 module: numpy... yes checking for numpy/arrayobject.h... yes checking for cairomm-1.16... no checking for cairomm-1.0... yes checking python3 module: cairo... yes checking for py3cairo.h... yes checking whether to enable sparsehash... yes checking for libsparsehash... yes checking for google/dense_hash_set... yes configure: pkgconfig directory is ${libdir}/pkgconfig checking our pkgconfig libname... graph-tool-py3.13 checking our pkgconfig version... 2.77 checking our pkgconfig_libdir... ${libdir}/pkgconfig expanded our pkgconfig_libdir... /usr/lib/x86_64-linux-gnu/pkgconfig checking our pkgconfig_libfile... graph-tool-py3.13.pc checking our package / suffix... graph-tool / checking our pkgconfig description... graph-tool Python library checking our pkgconfig requires... checking our pkgconfig ext libs... -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_python313 checking our pkgconfig cppflags... -I/usr/lib/python3.13/dist-packages/graph_tool/include -I/usr/lib/python3.13/dist-packages/graph_tool/include/boost-workaround -I/usr/lib/python3.13/dist-packages/graph_tool/include/pcg-cpp -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include checking our pkgconfig ldflags... noninstalled pkgconfig -L /build/reproducible-path/graph-tool-2.77+ds/_BUILD/.libs noninstalled pkgconfig -I /build/reproducible-path/graph-tool-2.77+ds/_BUILD/.. 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 config.status: executing graph-tool-py3.13.pc commands config.status: creating graph-tool-py3.13.pc.in config.status: creating graph-tool-py3.13.pc config.status: creating graph-tool-py3.13-uninstalled.pc config.status: creating graph-tool-py3.13-uninstalled.sh tput: unknown terminal "unknown" tput: unknown terminal "unknown" ================================================================================ tput: unknown terminal "unknown" tput: unknown terminal "unknown" CONFIGURATION SUMMARY tput: unknown terminal "unknown" tput: unknown terminal "unknown" ================================================================================ tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Using python version: 3.13.1 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Python interpreter: /usr/bin/python3 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Installation path: /usr/lib/python3.13/dist-packages/graph_tool tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" C++ compiler (CXX): g++ -std=gnu++17 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" C++ compiler version: 14 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Prefix: /usr tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Pkgconfigdir: ${libdir}/pkgconfig tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Python CPP flags: -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Python LD flags: -L/usr/lib/x86_64-linux-gnu -lpython3.13 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Boost CPP flags: -pthread -I/usr/include tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Boost LD flags: -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Numpy CPP flags: -I/usr/lib/python3/dist-packages/numpy/core/include tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Sparsehash CPP flags: tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" CGAL CPP flags: -I/usr/include tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" CGAL LD flags: tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Expat CPP flags: tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Expat LD flags: -lexpat tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Cairomm CPP flags: -I/usr/include/cairomm-1.0 -I/usr/lib/x86_64-linux-gnu/cairomm-1.0/include -I/usr/include/sigc++-2.0 -I/usr/lib/x86_64-linux-gnu/sigc++-2.0/include -I/usr/include/cairo -I/usr/include/libpng16 -I/usr/include/freetype2 -I/usr/include/pixman-1 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Cairomm LD flags: -lcairomm-1.0 -lsigc-2.0 -lcairo tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" OpenMP compiler flags: -fopenmp tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" OpenMP LD flags: tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Extra CPPFLAGS: -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Extra CXXFLAGS: -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Extra LDFLAGS: -Wl,-z,relro -Wl,-z,now tput: unknown terminal "unknown" Using OpenMP: tput: unknown terminal "unknown" tput: unknown terminal "unknown" yes tput: unknown terminal "unknown" Using sparsehash: tput: unknown terminal "unknown" tput: unknown terminal "unknown" yes tput: unknown terminal "unknown" Using cairo: tput: unknown terminal "unknown" tput: unknown terminal "unknown" yes tput: unknown terminal "unknown" tput: unknown terminal "unknown" ================================================================================ make[1]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds' rm -f debian/graph-tool-doc.debhelper.log debian/python3-graph-tool.debhelper.log debian/rules override_dh_auto_build make[1]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds' sh debian/show-mem-swap-nproc =========================== MemAvailable: 22410796 kB SwapFree: 25117044 kB nproc: 12 =========================== dh_auto_build --max-parallel=4 cd _BUILD && make -j4 make[2]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' make all-am make[3]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/epidemics/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/epidemics/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/epidemics/base_vec.cc /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/cising_glauber/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/cising_glauber/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/cising_glauber/base_vec.cc /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/ising_glauber/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/ising_glauber/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/ising_glauber/base_vec.cc /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/pseudo_cising/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/pseudo_cising/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/pseudo_cising/base_vec.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/epidemics/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/epidemics/.libs/libgraph_tool_inference_fast_la-base_vec.o libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/pseudo_cising/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/pseudo_cising/.libs/libgraph_tool_inference_fast_la-base_vec.o libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/ising_glauber/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/ising_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/cising_glauber/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/cising_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../dynamics_discrete.hh:28, from ../src/graph/inference/uncertain/dynamics/ising_glauber/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/ising_glauber/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/epidemics/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/epidemics/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/epidemics/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/epidemics/../dynamics_discrete.hh:28, from ../src/graph/inference/uncertain/dynamics/epidemics/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/epidemics/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/cising_glauber/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/cising_glauber/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/pseudo_ising/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/pseudo_ising/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/pseudo_ising/base_vec.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/pseudo_ising/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/pseudo_ising/.libs/libgraph_tool_inference_fast_la-base_vec.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/pseudo_normal/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/pseudo_normal/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/pseudo_normal/base_vec.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/pseudo_normal/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/pseudo_normal/.libs/libgraph_tool_inference_fast_la-base_vec.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/linear_normal/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/linear_normal/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/linear_normal/base_vec.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/linear_normal/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/linear_normal/.libs/libgraph_tool_inference_fast_la-base_vec.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/lotka_volterra/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/lotka_volterra/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/lotka_volterra/base_vec.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/lotka_volterra/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/lotka_volterra/.libs/libgraph_tool_inference_fast_la-base_vec.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../dynamics_discrete.hh:28, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/linear_normal/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/linear_normal/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/linear_normal/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/linear_normal/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/linear_normal/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/linear_normal/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/normal_glauber/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/normal_glauber/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/normal_glauber/base_vec.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/normal_glauber/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/normal_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include/cairomm-1.0 -I/usr/lib/x86_64-linux-gnu/cairomm-1.0/include -I/usr/include/sigc++-2.0 -I/usr/lib/x86_64-linux-gnu/sigc++-2.0/include -I/usr/include/cairo -I/usr/include/libpng16 -I/usr/include/freetype2 -I/usr/include/pixman-1 -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/draw/libgt_pycairo_aux_la-pycairo_aux.lo `test -f 'src/graph/draw/pycairo_aux.cc' || echo '../'`src/graph/draw/pycairo_aux.cc /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_betweenness.lo ../src/graph/centrality/graph_betweenness.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include/cairomm-1.0 -I/usr/lib/x86_64-linux-gnu/cairomm-1.0/include -I/usr/include/sigc++-2.0 -I/usr/lib/x86_64-linux-gnu/sigc++-2.0/include -I/usr/include/cairo -I/usr/include/libpng16 -I/usr/include/freetype2 -I/usr/include/pixman-1 -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/draw/pycairo_aux.cc -fPIC -DPIC -o src/graph/draw/.libs/libgt_pycairo_aux_la-pycairo_aux.o libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_betweenness.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_betweenness.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_centrality_bind.lo ../src/graph/centrality/graph_centrality_bind.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_centrality_bind.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_centrality_bind.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_closeness.lo ../src/graph/centrality/graph_closeness.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_closeness.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_closeness.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/normal_glauber/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/normal_glauber/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_eigentrust.lo ../src/graph/centrality/graph_eigentrust.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_eigentrust.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_eigentrust.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_eigenvector.lo ../src/graph/centrality/graph_eigenvector.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_eigenvector.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_eigenvector.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_hits.lo ../src/graph/centrality/graph_hits.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_hits.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_hits.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_katz.lo ../src/graph/centrality/graph_katz.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_katz.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_katz.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_pagerank.lo ../src/graph/centrality/graph_pagerank.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_pagerank.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_pagerank.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_trust_transitivity.lo ../src/graph/centrality/graph_trust_transitivity.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_trust_transitivity.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_trust_transitivity.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/clustering/graph_clustering.lo ../src/graph/clustering/graph_clustering.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/clustering/graph_clustering.cc -fPIC -DPIC -o src/graph/clustering/.libs/graph_clustering.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/clustering/../generation/sampler.hh:21, from ../src/graph/clustering/graph_clustering.hh:24, from ../src/graph/clustering/graph_clustering.cc:24: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/clustering/graph_extended_clustering.lo ../src/graph/clustering/graph_extended_clustering.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/clustering/graph_extended_clustering.cc -fPIC -DPIC -o src/graph/clustering/.libs/graph_extended_clustering.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/clustering/graph_motifs.lo ../src/graph/clustering/graph_motifs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/clustering/graph_motifs.cc -fPIC -DPIC -o src/graph/clustering/.libs/graph_motifs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/clustering/graph_motifs.hh:26, from ../src/graph/clustering/graph_motifs.cc:24: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/base64.lo ../src/graph/base64.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/base64.cc -fPIC -DPIC -o src/graph/.libs/base64.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/demangle.lo ../src/graph/demangle.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/demangle.cc -fPIC -DPIC -o src/graph/.libs/demangle.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph.lo ../src/graph/graph.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph.cc -fPIC -DPIC -o src/graph/.libs/graph.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_exceptions.lo ../src/graph/graph_exceptions.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_exceptions.cc -fPIC -DPIC -o src/graph/.libs/graph_exceptions.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_bind.lo ../src/graph/graph_bind.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_bind.cc -fPIC -DPIC -o src/graph/.libs/graph_bind.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_copy.lo ../src/graph/graph_copy.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_copy.cc -fPIC -DPIC -o src/graph/.libs/graph_copy.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/graph_bind.cc:26: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_filtering.lo ../src/graph/graph_filtering.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_filtering.cc -fPIC -DPIC -o src/graph/.libs/graph_filtering.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_io.lo ../src/graph/graph_io.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_io.cc -fPIC -DPIC -o src/graph/.libs/graph_io.o In file included from ../src/graph/graph.hh:33, from ../src/graph/graph_bind.cc:18: In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'vector_from_list::construct(PyObject*, boost::python::converter::rvalue_from_python_stage1_data*)::' at ../src/graph/graph_bind.cc:88:37, inlined from 'static void vector_from_list::construct(PyObject*, boost::python::converter::rvalue_from_python_stage1_data*) [with ValueType = boost::any]' at ../src/graph/graph_bind.cc:111:22: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ In file included from /usr/include/boost/python.hpp:66, from ../src/graph/numpy_bind.hh:22, from ../src/graph/graph_bind.cc:22: /usr/include/boost/python/stl_iterator.hpp: In static member function 'static void vector_from_list::construct(PyObject*, boost::python::converter::rvalue_from_python_stage1_data*) [with ValueType = boost::any]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from ../src/graph/graph.hh:33, from ../src/graph/graph_copy.cc:18: In copy constructor 'boost::any::any(const boost::any&)', inlined from 'graph_tool::GraphInterface::GraphInterface(const graph_tool::GraphInterface&, bool, boost::python::api::object, boost::python::api::object, boost::python::api::object)' at ../src/graph/graph_copy.cc:282:62: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ ../src/graph/graph_copy.cc: In constructor 'graph_tool::GraphInterface::GraphInterface(const graph_tool::GraphInterface&, bool, boost::python::api::object, boost::python::api::object, boost::python::api::object)': ../src/graph/graph_copy.cc:282:60: note: '' declared here 282 | boost::any avorder = python::extract(vorder)(); | ^ In file included from ../src/graph/graph.hh:42: ../src/graph/graph_properties.hh: In member function 'const std::string& graph_tool::get_type_name::operator()(const std::type_info&) const [with TypeSequence = boost::mpl::vector15, std::vector, std::vector, std::vector, std::vector, std::vector, std::vector, std::vector >, boost::python::api::object>; NamedSequence = boost::mpl::vector15, std::vector, std::vector, std::vector, std::vector, std::vector, std::vector, std::vector >, boost::python::api::object>]': ../src/graph/graph_properties.hh:197:17: warning: 'name' may be used uninitialized [-Wmaybe-uninitialized] 197 | return *name; | ^~~~ ../src/graph/graph_properties.hh:194:28: note: 'name' was declared here 194 | std::string const* name; | ^~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_openmp.lo ../src/graph/graph_openmp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_openmp.cc -fPIC -DPIC -o src/graph/.libs/graph_openmp.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties.lo ../src/graph/graph_properties.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties.cc -fPIC -DPIC -o src/graph/.libs/graph_properties.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_imp1.lo ../src/graph/graph_properties_imp1.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_imp1.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_imp1.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_imp2.lo ../src/graph/graph_properties_imp2.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_imp2.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_imp2.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_imp3.lo ../src/graph/graph_properties_imp3.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_imp3.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_imp3.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_imp4.lo ../src/graph/graph_properties_imp4.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_imp4.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_imp4.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_copy.lo ../src/graph/graph_properties_copy.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_copy.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_copy.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_copy_imp1.lo ../src/graph/graph_properties_copy_imp1.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_copy_imp1.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_copy_imp1.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_group.lo ../src/graph/graph_properties_group.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_group.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_group.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_ungroup.lo ../src/graph/graph_properties_ungroup.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_ungroup.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_ungroup.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_map_values.lo ../src/graph/graph_properties_map_values.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_map_values.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_map_values.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_map_values_imp1.lo ../src/graph/graph_properties_map_values_imp1.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_map_values_imp1.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_map_values_imp1.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_python_interface.lo ../src/graph/graph_python_interface.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_python_interface.cc -fPIC -DPIC -o src/graph/.libs/graph_python_interface.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_python_interface_imp1.lo ../src/graph/graph_python_interface_imp1.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_python_interface_imp1.cc -fPIC -DPIC -o src/graph/.libs/graph_python_interface_imp1.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_python_interface_export.lo ../src/graph/graph_python_interface_export.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_python_interface_export.cc -fPIC -DPIC -o src/graph/.libs/graph_python_interface_export.o In file included from ../src/graph/graph.hh:33, from ../src/graph/graph_filtering.hh:21, from ../src/graph/graph_python_interface_imp1.cc:18: In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ In file included from /usr/include/boost/python.hpp:66, from ../src/graph/gil_release.hh:21, from ../src/graph/graph_filtering.hh:35: /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/graph_python_interface.cc:21: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16, inlined from 'boost::coroutines2::detail::pull_coroutine::~pull_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_coroutine.ipp:64:24, inlined from 'constexpr void std::_Destroy(_Tp*) [with _Tp = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/stl_construct.h:151:22, inlined from 'static void std::allocator_traits >::destroy(allocator_type&, _Up*) [with _Up = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/alloc_traits.h:720:17, inlined from 'void std::_Sp_counted_ptr_inplace<_Tp, _Alloc, _Lp>::_M_dispose() [with _Tp = boost::coroutines2::detail::pull_coroutine; _Alloc = std::allocator; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:616:35: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)MEM[(struct pull_coroutine *)this_2(D) + 16B].cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_iter::operator()(Graph&, boost::python::api::object&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >]' at ../src/graph/graph_python_interface_imp1.cc:140:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_iter::operator()(Graph&, boost::python::api::object&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_iter::operator()(Graph&, boost::python::api::object&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >]' at ../src/graph/graph_python_interface_imp1.cc:140:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_iter::operator()(Graph&, boost::python::api::object&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_iter::operator()(Graph&, boost::python::api::object&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >]' at ../src/graph/graph_python_interface_imp1.cc:140:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_iter::operator()(Graph&, boost::python::api::object&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_selectors.lo ../src/graph/graph_selectors.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_selectors.cc -fPIC -DPIC -o src/graph/.libs/graph_selectors.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graphml.lo ../src/graph/graphml.cpp libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graphml.cpp -fPIC -DPIC -o src/graph/.libs/graphml.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/openmp.lo ../src/graph/openmp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/openmp.cc -fPIC -DPIC -o src/graph/.libs/openmp.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/random.lo ../src/graph/random.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/random.cc -fPIC -DPIC -o src/graph/.libs/random.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/random.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/read_graphviz_new.lo ../src/graph/read_graphviz_new.cpp libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/read_graphviz_new.cpp -fPIC -DPIC -o src/graph/.libs/read_graphviz_new.o In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_assortativity.lo ../src/graph/correlations/graph_assortativity.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_assortativity.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_assortativity.o In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_correlations.lo ../src/graph/correlations/graph_correlations.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_correlations.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_correlations.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_correlations_imp1.lo ../src/graph/correlations/graph_correlations_imp1.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_correlations_imp1.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_correlations_imp1.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_avg_correlations.lo ../src/graph/correlations/graph_avg_correlations.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_avg_correlations.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_avg_correlations.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_avg_correlations_imp1.lo ../src/graph/correlations/graph_avg_correlations_imp1.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_avg_correlations_imp1.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_avg_correlations_imp1.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_avg_correlations_combined.lo ../src/graph/correlations/graph_avg_correlations_combined.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_avg_correlations_combined.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_avg_correlations_combined.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_correlations_combined.lo ../src/graph/correlations/graph_correlations_combined.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_correlations_combined.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_correlations_combined.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_correlations_bind.lo ../src/graph/correlations/graph_correlations_bind.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_correlations_bind.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_correlations_bind.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include/cairomm-1.0 -I/usr/lib/x86_64-linux-gnu/cairomm-1.0/include -I/usr/include/sigc++-2.0 -I/usr/lib/x86_64-linux-gnu/sigc++-2.0/include -I/usr/include/cairo -I/usr/include/libpng16 -I/usr/include/freetype2 -I/usr/include/pixman-1 -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/draw/libgraph_tool_draw_la-graph_cairo_draw.lo `test -f 'src/graph/draw/graph_cairo_draw.cc' || echo '../'`src/graph/draw/graph_cairo_draw.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include/cairomm-1.0 -I/usr/lib/x86_64-linux-gnu/cairomm-1.0/include -I/usr/include/sigc++-2.0 -I/usr/lib/x86_64-linux-gnu/sigc++-2.0/include -I/usr/include/cairo -I/usr/include/libpng16 -I/usr/include/freetype2 -I/usr/include/pixman-1 -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/draw/graph_cairo_draw.cc -fPIC -DPIC -o src/graph/draw/.libs/libgraph_tool_draw_la-graph_cairo_draw.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include/cairomm-1.0 -I/usr/lib/x86_64-linux-gnu/cairomm-1.0/include -I/usr/include/sigc++-2.0 -I/usr/lib/x86_64-linux-gnu/sigc++-2.0/include -I/usr/include/cairo -I/usr/include/libpng16 -I/usr/include/freetype2 -I/usr/include/pixman-1 -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/draw/libgraph_tool_draw_la-graph_tree_cts.lo `test -f 'src/graph/draw/graph_tree_cts.cc' || echo '../'`src/graph/draw/graph_tree_cts.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include/cairomm-1.0 -I/usr/lib/x86_64-linux-gnu/cairomm-1.0/include -I/usr/include/sigc++-2.0 -I/usr/lib/x86_64-linux-gnu/sigc++-2.0/include -I/usr/include/cairo -I/usr/include/libpng16 -I/usr/include/freetype2 -I/usr/include/pixman-1 -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/draw/graph_tree_cts.cc -fPIC -DPIC -o src/graph/draw/.libs/libgraph_tool_draw_la-graph_tree_cts.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/dynamics/graph_continuous.lo ../src/graph/dynamics/graph_continuous.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/dynamics/graph_continuous.cc -fPIC -DPIC -o src/graph/dynamics/.libs/graph_continuous.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/dynamics/graph_continuous.hh:27, from ../src/graph/dynamics/graph_continuous.cc:26: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/draw/graph_cairo_draw.cc:35: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/dynamics/graph_discrete.lo ../src/graph/dynamics/graph_discrete.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/dynamics/graph_discrete.cc -fPIC -DPIC -o src/graph/dynamics/.libs/graph_discrete.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/dynamics/graph_discrete.hh:27, from ../src/graph/dynamics/graph_discrete.cc:27: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/dynamics/graph_dynamics.lo ../src/graph/dynamics/graph_dynamics.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/dynamics/graph_dynamics.cc -fPIC -DPIC -o src/graph/dynamics/.libs/graph_dynamics.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/dynamics/graph_normal_bp.lo ../src/graph/dynamics/graph_normal_bp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/dynamics/graph_normal_bp.cc -fPIC -DPIC -o src/graph/dynamics/.libs/graph_normal_bp.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/dynamics/graph_normal_bp.hh:24, from ../src/graph/dynamics/graph_normal_bp.cc:27: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/dynamics/graph_potts_bp.lo ../src/graph/dynamics/graph_potts_bp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/dynamics/graph_potts_bp.cc -fPIC -DPIC -o src/graph/dynamics/.libs/graph_potts_bp.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/dynamics/graph_potts_bp.hh:24, from ../src/graph/dynamics/graph_potts_bp.cc:27: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/flow/graph_edmonds_karp.lo ../src/graph/flow/graph_edmonds_karp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/flow/graph_edmonds_karp.cc -fPIC -DPIC -o src/graph/flow/.libs/graph_edmonds_karp.o In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/flow/graph_push_relabel.lo ../src/graph/flow/graph_push_relabel.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/flow/graph_push_relabel.cc -fPIC -DPIC -o src/graph/flow/.libs/graph_push_relabel.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/flow/graph_kolmogorov.lo ../src/graph/flow/graph_kolmogorov.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/flow/graph_kolmogorov.cc -fPIC -DPIC -o src/graph/flow/.libs/graph_kolmogorov.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/flow/graph_minimum_cut.lo ../src/graph/flow/graph_minimum_cut.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/flow/graph_minimum_cut.cc -fPIC -DPIC -o src/graph/flow/.libs/graph_minimum_cut.o In file included from /usr/include/boost/tuple/tuple.hpp:28, from /usr/include/boost/graph/graph_traits.hpp:16, from ../src/graph/graph_adjacency.hh:25, from ../src/graph/graph.hh:35, from ../src/graph/graph_filtering.hh:21, from ../src/graph/flow/graph_minimum_cut.cc:18: In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const long double; HT = long double]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long double; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const long double; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long double; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long double]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ In file included from ../src/graph/flow/graph_minimum_cut.cc:23: ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const short int; HT = short int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const short int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const short int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = short int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = short int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const int; HT = int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const long double; HT = long double]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long double; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const long double; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long double; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long double]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const long unsigned int; HT = long unsigned int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const long unsigned int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long unsigned int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long unsigned int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = graph_tool::UnityPropertyMap >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = graph_tool::UnityPropertyMap >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const long int; HT = long int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const long int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const double; HT = double]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const double; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const double; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = double; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = double]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const unsigned char; HT = unsigned char]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const unsigned char; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const unsigned char; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = unsigned char; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = unsigned char]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/flow/graph_flow_bind.lo ../src/graph/flow/graph_flow_bind.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/flow/graph_flow_bind.cc -fPIC -DPIC -o src/graph/flow/.libs/graph_flow_bind.o In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const long unsigned int; HT = long unsigned int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const long unsigned int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long unsigned int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long unsigned int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = graph_tool::UnityPropertyMap >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = graph_tool::UnityPropertyMap >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const unsigned char; HT = unsigned char]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const unsigned char; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const unsigned char; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = unsigned char; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = unsigned char]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const long int; HT = long int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const long int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_community_network.lo `test -f 'src/graph/generation/graph_community_network.cc' || echo '../'`src/graph/generation/graph_community_network.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_community_network.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network.o In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const double; HT = double]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const double; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const double; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = double; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = double]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const short int; HT = short int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const short int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const short int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = short int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = short int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const int; HT = int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_community_network_eavg.lo `test -f 'src/graph/generation/graph_community_network_eavg.cc' || echo '../'`src/graph/generation/graph_community_network_eavg.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_community_network_eavg.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_eavg.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_community_network_eavg_imp1.lo `test -f 'src/graph/generation/graph_community_network_eavg_imp1.cc' || echo '../'`src/graph/generation/graph_community_network_eavg_imp1.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_community_network_eavg_imp1.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_eavg_imp1.o In file included from ../src/graph/graph.hh:33, from ../src/graph/generation/graph_community_network_eavg.cc:18: In copy constructor 'boost::any::any(const boost::any&)', inlined from 'void community_network_eavg(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::python::list, bool, bool)' at ../src/graph/generation/graph_community_network_eavg.cc:82:72: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ ../src/graph/generation/graph_community_network_eavg.cc: In function 'void community_network_eavg(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::python::list, bool, bool)': ../src/graph/generation/graph_community_network_eavg.cc:82:70: note: '' declared here 82 | boost::any ceprop = boost::python::extract(aeprops[i][2])(); | ^ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'void community_network_eavg(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::python::list, bool, bool)' at ../src/graph/generation/graph_community_network_eavg.cc:80:71: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ ../src/graph/generation/graph_community_network_eavg.cc: In function 'void community_network_eavg(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::python::list, bool, bool)': ../src/graph/generation/graph_community_network_eavg.cc:80:69: note: '' declared here 80 | boost::any eprop = boost::python::extract(aeprops[i][0])(); | ^ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_community_network_edges.lo `test -f 'src/graph/generation/graph_community_network_edges.cc' || echo '../'`src/graph/generation/graph_community_network_edges.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_community_network_edges.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_edges.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_community_network_vavg.lo `test -f 'src/graph/generation/graph_community_network_vavg.cc' || echo '../'`src/graph/generation/graph_community_network_vavg.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_community_network_vavg.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_vavg.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_complete.lo `test -f 'src/graph/generation/graph_complete.cc' || echo '../'`src/graph/generation/graph_complete.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_complete.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_complete.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_contract_edges.lo `test -f 'src/graph/generation/graph_contract_edges.cc' || echo '../'`src/graph/generation/graph_contract_edges.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_contract_edges.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_contract_edges.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/graph_contract_edges.hh:23, from ../src/graph/generation/graph_contract_edges.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_generation.lo `test -f 'src/graph/generation/graph_generation.cc' || echo '../'`src/graph/generation/graph_generation.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_generation.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_generation.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/graph_generation.hh:26, from ../src/graph/generation/graph_generation.cc:27: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_geometric.lo `test -f 'src/graph/generation/graph_geometric.cc' || echo '../'`src/graph/generation/graph_geometric.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_geometric.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_geometric.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_knn.lo `test -f 'src/graph/generation/graph_knn.cc' || echo '../'`src/graph/generation/graph_knn.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_knn.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_knn.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/generation/graph_knn.hh:30, from ../src/graph/generation/graph_knn.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_lattice.lo `test -f 'src/graph/generation/graph_lattice.cc' || echo '../'`src/graph/generation/graph_lattice.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_lattice.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_lattice.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_line_graph.lo `test -f 'src/graph/generation/graph_line_graph.cc' || echo '../'`src/graph/generation/graph_line_graph.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_line_graph.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_line_graph.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_maxent_sbm.lo `test -f 'src/graph/generation/graph_maxent_sbm.cc' || echo '../'`src/graph/generation/graph_maxent_sbm.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_maxent_sbm.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_maxent_sbm.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/sampler.hh:21, from ../src/graph/generation/graph_maxent_sbm.hh:26, from ../src/graph/generation/graph_maxent_sbm.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_parallel.lo `test -f 'src/graph/generation/graph_parallel.cc' || echo '../'`src/graph/generation/graph_parallel.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_parallel.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_parallel.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_predecessor.lo `test -f 'src/graph/generation/graph_predecessor.cc' || echo '../'`src/graph/generation/graph_predecessor.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_predecessor.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_predecessor.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_price.lo `test -f 'src/graph/generation/graph_price.cc' || echo '../'`src/graph/generation/graph_price.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_price.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_price.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/graph_price.hh:23, from ../src/graph/generation/graph_price.cc:21: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_random_edges.lo `test -f 'src/graph/generation/graph_random_edges.cc' || echo '../'`src/graph/generation/graph_random_edges.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_random_edges.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_random_edges.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_rewiring.lo `test -f 'src/graph/generation/graph_rewiring.cc' || echo '../'`src/graph/generation/graph_rewiring.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_rewiring.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_rewiring.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/graph_random_edges.hh:23, from ../src/graph/generation/graph_random_edges.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/sampler.hh:21, from ../src/graph/generation/graph_rewiring.hh:27, from ../src/graph/generation/graph_rewiring.cc:23: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_sbm.lo `test -f 'src/graph/generation/graph_sbm.cc' || echo '../'`src/graph/generation/graph_sbm.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_sbm.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_sbm.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/sampler.hh:21, from ../src/graph/generation/graph_sbm.hh:24, from ../src/graph/generation/graph_sbm.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_triadic_closure.lo `test -f 'src/graph/generation/graph_triadic_closure.cc' || echo '../'`src/graph/generation/graph_triadic_closure.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_triadic_closure.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_triadic_closure.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/sampler.hh:21, from ../src/graph/generation/graph_triadic_closure.hh:27, from ../src/graph/generation/graph_triadic_closure.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_triangulation.lo `test -f 'src/graph/generation/graph_triangulation.cc' || echo '../'`src/graph/generation/graph_triangulation.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_triangulation.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_triangulation.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_union.lo `test -f 'src/graph/generation/graph_union.cc' || echo '../'`src/graph/generation/graph_union.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_union.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_union.o In file included from ../src/graph/graph.hh:33, from ../src/graph/generation/graph_community_network_vavg.cc:18: In copy constructor 'boost::any::any(const boost::any&)', inlined from 'void community_network_vavg(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::python::list)' at ../src/graph/generation/graph_community_network_vavg.cc:91:71: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ ../src/graph/generation/graph_community_network_vavg.cc: In function 'void community_network_vavg(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::python::list)': ../src/graph/generation/graph_community_network_vavg.cc:91:69: note: '' declared here 91 | boost::any vprop = boost::python::extract(avprops[i][0])(); | ^ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_union_eprop.lo `test -f 'src/graph/generation/graph_union_eprop.cc' || echo '../'`src/graph/generation/graph_union_eprop.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_union_eprop.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_union_eprop.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_union_vprop.lo `test -f 'src/graph/generation/graph_union_vprop.cc' || echo '../'`src/graph/generation/graph_union_vprop.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_union_vprop.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_union_vprop.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel.lo ../src/graph/inference/blockmodel/graph_blockmodel.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_em.lo ../src/graph/inference/blockmodel/graph_blockmodel_em.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_em.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_em.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_em.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_exhaustive.lo ../src/graph/inference/blockmodel/graph_blockmodel_exhaustive.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_exhaustive.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_exhaustive.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_exhaustive.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_gibbs.lo ../src/graph/inference/blockmodel/graph_blockmodel_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_gibbs.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_gibbs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_imp.lo ../src/graph/inference/blockmodel/graph_blockmodel_imp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_imp.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_imp.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_imp.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_imp2.lo ../src/graph/inference/blockmodel/graph_blockmodel_imp2.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_imp2.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_imp2.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_imp2.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/inference/blockmodel/../loops/exhaustive_loop.hh:22, from ../src/graph/inference/blockmodel/graph_blockmodel_exhaustive.cc:26: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_imp3.lo ../src/graph/inference/blockmodel/graph_blockmodel_imp3.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_imp3.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_imp3.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_imp3.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_marginals.lo ../src/graph/inference/blockmodel/graph_blockmodel_marginals.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_marginals.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_marginals.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_mcmc.lo ../src/graph/inference/blockmodel/graph_blockmodel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_mcmc.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_multicanonical.lo ../src/graph/inference/blockmodel/graph_blockmodel_multicanonical.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_multicanonical.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_multicanonical.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_multicanonical.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_multicanonical_multiflip.lo ../src/graph/inference/blockmodel/graph_blockmodel_multicanonical_multiflip.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_multicanonical_multiflip.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_multicanonical_multiflip.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_multicanonical_multiflip.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_multiflip_mcmc.lo ../src/graph/inference/blockmodel/graph_blockmodel_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_multilevel_mcmc.lo ../src/graph/inference/blockmodel/graph_blockmodel_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/cliques/graph_clique_decomposition.lo ../src/graph/inference/cliques/graph_clique_decomposition.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/cliques/graph_clique_decomposition.cc -fPIC -DPIC -o src/graph/inference/cliques/.libs/graph_clique_decomposition.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/cliques/graph_clique_decomposition.cc:20: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/histogram/graph_histogram.lo ../src/graph/inference/histogram/graph_histogram.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/histogram/graph_histogram.cc -fPIC -DPIC -o src/graph/inference/histogram/.libs/graph_histogram.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/histogram/graph_histogram.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/histogram/graph_histogram_mcmc.lo ../src/graph/inference/histogram/graph_histogram_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/histogram/graph_histogram_mcmc.cc -fPIC -DPIC -o src/graph/inference/histogram/.libs/graph_histogram_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/histogram/graph_histogram_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/modularity/graph_modularity.lo ../src/graph/inference/modularity/graph_modularity.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/modularity/graph_modularity.cc -fPIC -DPIC -o src/graph/inference/modularity/.libs/graph_modularity.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/modularity/../blockmodel/../../generation/sampler.hh:21, from ../src/graph/inference/modularity/../blockmodel/graph_blockmodel_elist.hh:21, from ../src/graph/inference/modularity/../blockmodel/graph_blockmodel_util.hh:29, from ../src/graph/inference/modularity/graph_modularity.hh:27, from ../src/graph/inference/modularity/graph_modularity.cc:22: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/modularity/graph_modularity_gibbs.lo ../src/graph/inference/modularity/graph_modularity_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/modularity/graph_modularity_gibbs.cc -fPIC -DPIC -o src/graph/inference/modularity/.libs/graph_modularity_gibbs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/modularity/graph_modularity_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/modularity/graph_modularity_mcmc.lo ../src/graph/inference/modularity/graph_modularity_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/modularity/graph_modularity_mcmc.cc -fPIC -DPIC -o src/graph/inference/modularity/.libs/graph_modularity_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/modularity/graph_modularity_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/modularity/graph_modularity_multiflip_mcmc.lo ../src/graph/inference/modularity/graph_modularity_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/modularity/graph_modularity_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/modularity/.libs/graph_modularity_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/modularity/graph_modularity_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/modularity/graph_modularity_multilevel_mcmc.lo ../src/graph/inference/modularity/graph_modularity_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/modularity/graph_modularity_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/modularity/.libs/graph_modularity_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/modularity/graph_modularity_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/norm_cut/graph_norm_cut.lo ../src/graph/inference/norm_cut/graph_norm_cut.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/norm_cut/graph_norm_cut.cc -fPIC -DPIC -o src/graph/inference/norm_cut/.libs/graph_norm_cut.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/norm_cut/../blockmodel/../../generation/sampler.hh:21, from ../src/graph/inference/norm_cut/../blockmodel/graph_blockmodel_elist.hh:21, from ../src/graph/inference/norm_cut/../blockmodel/graph_blockmodel_util.hh:29, from ../src/graph/inference/norm_cut/graph_norm_cut.hh:27, from ../src/graph/inference/norm_cut/graph_norm_cut.cc:22: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/norm_cut/graph_norm_cut_gibbs.lo ../src/graph/inference/norm_cut/graph_norm_cut_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/norm_cut/graph_norm_cut_gibbs.cc -fPIC -DPIC -o src/graph/inference/norm_cut/.libs/graph_norm_cut_gibbs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/norm_cut/graph_norm_cut_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/norm_cut/graph_norm_cut_mcmc.lo ../src/graph/inference/norm_cut/graph_norm_cut_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/norm_cut/graph_norm_cut_mcmc.cc -fPIC -DPIC -o src/graph/inference/norm_cut/.libs/graph_norm_cut_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/norm_cut/graph_norm_cut_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/norm_cut/graph_norm_cut_multiflip_mcmc.lo ../src/graph/inference/norm_cut/graph_norm_cut_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/norm_cut/graph_norm_cut_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/norm_cut/.libs/graph_norm_cut_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/norm_cut/graph_norm_cut_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/norm_cut/graph_norm_cut_multilevel_mcmc.lo ../src/graph/inference/norm_cut/graph_norm_cut_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/norm_cut/graph_norm_cut_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/norm_cut/.libs/graph_norm_cut_multilevel_mcmc.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid.lo ../src/graph/inference/partition_centroid/graph_partition_centroid.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/norm_cut/graph_norm_cut_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid_mcmc.lo ../src/graph/inference/partition_centroid/graph_partition_centroid_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid_multiflip_mcmc.lo ../src/graph/inference/partition_centroid/graph_partition_centroid_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid_multilevel_mcmc.lo ../src/graph/inference/partition_centroid/graph_partition_centroid_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid_rmi.lo ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid_rmi_mcmc.lo ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multiflip_mcmc.lo ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multilevel_mcmc.lo ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_modes/graph_partition_mode.lo ../src/graph/inference/partition_modes/graph_partition_mode.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_modes/graph_partition_mode.cc -fPIC -DPIC -o src/graph/inference/partition_modes/.libs/graph_partition_mode.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_modes/graph_partition_mode.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_modes/graph_partition_mode_clustering.lo ../src/graph/inference/partition_modes/graph_partition_mode_clustering.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_modes/graph_partition_mode_clustering.cc -fPIC -DPIC -o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_modes/graph_partition_mode_clustering.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/boost/multi_array/storage_order.hpp:18, from /usr/include/boost/multi_array/base.hpp:25, from /usr/include/boost/multi_array.hpp:29, from ../src/graph/numpy_bind.hh:34, from ../src/graph/inference/partition_modes/graph_partition_mode.cc:20: In function 'OutputIter boost::detail::multi_array::copy_n(InputIter, Size, OutputIter) [with InputIter = const long int*; Size = long unsigned int; OutputIter = long int*]', inlined from 'boost::detail::multi_array::const_multi_array_view::const_multi_array_view(TPtr, const ExtentList&, const boost::array&) [with ExtentList = boost::array; Index = long int; T = int; long unsigned int NumDims = 1; TPtr = int*]' at /usr/include/boost/multi_array/view.hpp:240:13, inlined from 'boost::detail::multi_array::multi_array_view::multi_array_view(T*, const ExtentList&, const boost::array&) [with ExtentList = boost::array; Index = long int; T = int; long unsigned int NumDims = 1]' at /usr/include/boost/multi_array/view.hpp:434:36, inlined from 'ArrayRef boost::detail::multi_array::multi_array_impl_base::generate_array_view(boost::type, const boost::detail::multi_array::index_gen&, const size_type*, const index*, const index*, TPtr) const [with ArrayRef = boost::detail::multi_array::multi_array_view; int NDims = 1; TPtr = int*; T = int; long unsigned int NumDims = 2]' at /usr/include/boost/multi_array/base.hpp:490:27, inlined from 'typename boost::multi_array_ref::array_view::type boost::multi_array_ref::operator[](const boost::detail::multi_array::index_gen&) [with int NDims = 1; T = int; long unsigned int NumDims = 2]' at /usr/include/boost/multi_array/multi_array_ref.hpp:539:47, inlined from '_ZN10graph_tool24partition_overlap_centerIN5boost15multi_array_refIiLm1EEENS2_IiLm2EEEEEdRT_RT0_._omp_fn.0' at ../src/graph/inference/partition_modes/graph_partition_mode.hh:269:38: /usr/include/boost/multi_array/algorithm.hpp:56:13: warning: 'new_strides$elems$' may be used uninitialized [-Wmaybe-uninitialized] 56 | *result = *first; | ~~~~~~~~^~~~~~~~ /usr/include/boost/multi_array/base.hpp: In function '_ZN10graph_tool24partition_overlap_centerIN5boost15multi_array_refIiLm1EEENS2_IiLm2EEEEEdRT_RT0_._omp_fn.0': /usr/include/boost/multi_array/base.hpp:416:31: note: 'new_strides$elems$' was declared here 416 | boost::array new_strides; | ^~~~~~~~~~~ In function 'OutputIter boost::detail::multi_array::copy_n(InputIter, Size, OutputIter) [with InputIter = const long int*; Size = long unsigned int; OutputIter = long unsigned int*]', inlined from 'boost::detail::multi_array::const_multi_array_view::const_multi_array_view(TPtr, const ExtentList&, const boost::array&) [with ExtentList = boost::array; Index = long int; T = int; long unsigned int NumDims = 1; TPtr = int*]' at /usr/include/boost/multi_array/view.hpp:238:13, inlined from 'boost::detail::multi_array::multi_array_view::multi_array_view(T*, const ExtentList&, const boost::array&) [with ExtentList = boost::array; Index = long int; T = int; long unsigned int NumDims = 1]' at /usr/include/boost/multi_array/view.hpp:434:36, inlined from 'ArrayRef boost::detail::multi_array::multi_array_impl_base::generate_array_view(boost::type, const boost::detail::multi_array::index_gen&, const size_type*, const index*, const index*, TPtr) const [with ArrayRef = boost::detail::multi_array::multi_array_view; int NDims = 1; TPtr = int*; T = int; long unsigned int NumDims = 2]' at /usr/include/boost/multi_array/base.hpp:490:27, inlined from 'typename boost::multi_array_ref::array_view::type boost::multi_array_ref::operator[](const boost::detail::multi_array::index_gen&) [with int NDims = 1; T = int; long unsigned int NumDims = 2]' at /usr/include/boost/multi_array/multi_array_ref.hpp:539:47, inlined from '_ZN10graph_tool24partition_overlap_centerIN5boost15multi_array_refIiLm1EEENS2_IiLm2EEEEEdRT_RT0_._omp_fn.0' at ../src/graph/inference/partition_modes/graph_partition_mode.hh:269:38: /usr/include/boost/multi_array/algorithm.hpp:56:13: warning: 'new_extents$elems$' may be used uninitialized [-Wmaybe-uninitialized] 56 | *result = *first; | ~~~~~~~~^~~~~~~~ /usr/include/boost/multi_array/base.hpp: In function '_ZN10graph_tool24partition_overlap_centerIN5boost15multi_array_refIiLm1EEENS2_IiLm2EEEEEdRT_RT0_._omp_fn.0': /usr/include/boost/multi_array/base.hpp:417:31: note: 'new_extents$elems$' was declared here 417 | boost::array new_extents; | ^~~~~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_modes/graph_partition_mode_clustering_mcmc.lo ../src/graph/inference/partition_modes/graph_partition_mode_clustering_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_modes/graph_partition_mode_clustering_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering_mcmc.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_modes/graph_partition_mode_clustering_multiflip_mcmc.lo ../src/graph/inference/partition_modes/graph_partition_mode_clustering_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_modes/graph_partition_mode_clustering_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_modes/graph_partition_mode_clustering_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_modes/graph_partition_mode_clustering_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_modes/graph_partition_mode_clustering_multilevel_mcmc.lo ../src/graph/inference/partition_modes/graph_partition_mode_clustering_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_modes/graph_partition_mode_clustering_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_modes/graph_partition_mode_clustering_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/planted_partition/graph_planted_partition.lo ../src/graph/inference/planted_partition/graph_planted_partition.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/planted_partition/graph_planted_partition.cc -fPIC -DPIC -o src/graph/inference/planted_partition/.libs/graph_planted_partition.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/planted_partition/graph_planted_partition.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/planted_partition/graph_planted_partition_gibbs.lo ../src/graph/inference/planted_partition/graph_planted_partition_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/planted_partition/graph_planted_partition_gibbs.cc -fPIC -DPIC -o src/graph/inference/planted_partition/.libs/graph_planted_partition_gibbs.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/planted_partition/graph_planted_partition_mcmc.lo ../src/graph/inference/planted_partition/graph_planted_partition_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/planted_partition/graph_planted_partition_mcmc.cc -fPIC -DPIC -o src/graph/inference/planted_partition/.libs/graph_planted_partition_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/planted_partition/graph_planted_partition_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/planted_partition/graph_planted_partition_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/planted_partition/graph_planted_partition_multiflip_mcmc.lo ../src/graph/inference/planted_partition/graph_planted_partition_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/planted_partition/graph_planted_partition_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/planted_partition/.libs/graph_planted_partition_multiflip_mcmc.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/planted_partition/graph_planted_partition_multilevel_mcmc.lo ../src/graph/inference/planted_partition/graph_planted_partition_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/planted_partition/graph_planted_partition_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/planted_partition/.libs/graph_planted_partition_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/planted_partition/graph_planted_partition_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/planted_partition/graph_planted_partition_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap.lo ../src/graph/inference/overlap/graph_blockmodel_overlap.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_exhaustive.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_exhaustive.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_exhaustive.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_exhaustive.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_exhaustive.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/inference/overlap/../loops/exhaustive_loop.hh:22, from ../src/graph/inference/overlap/graph_blockmodel_overlap_exhaustive.cc:26: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_gibbs.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_gibbs.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_gibbs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_mcmc.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_mcmc.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_mcmc_bundled.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_mcmc_bundled.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_mcmc_bundled.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_mcmc_bundled.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_mcmc_bundled.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multicanonical.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical_multiflip.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical_multiflip.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical_multiflip.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multicanonical_multiflip.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical_multiflip.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_multiflip_mcmc.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_multilevel_mcmc.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_vacate.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_vacate.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_vacate.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_vacate.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_vacate.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers.lo ../src/graph/inference/layers/graph_blockmodel_layers.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers.cc:23: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_exhaustive.lo ../src/graph/inference/layers/graph_blockmodel_layers_exhaustive.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_exhaustive.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_exhaustive.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_exhaustive.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/c++/14/bits/shared_ptr.h:53, from /usr/include/c++/14/memory:80, from /usr/include/boost/config/no_tr1/memory.hpp:21, from /usr/include/boost/get_pointer.hpp:14, from /usr/include/boost/python/object/pointer_holder.hpp:11, from /usr/include/boost/python/to_python_indirect.hpp:10, from /usr/include/boost/python/converter/arg_to_python.hpp:10, from /usr/include/boost/python/call.hpp:15, from /usr/include/boost/python/object_core.hpp:14, from /usr/include/boost/python/object.hpp:9, from ../src/graph/graph.hh:29, from ../src/graph/inference/layers/graph_blockmodel_layers.cc:19: In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ In file included from ../src/graph/inference/layers/../blockmodel/graph_blockmodel.hh:31, from ../src/graph/inference/layers/graph_blockmodel_layers.cc:26: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/inference/layers/../loops/exhaustive_loop.hh:22, from ../src/graph/inference/layers/graph_blockmodel_layers_exhaustive.cc:29: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_layered_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_layered_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_layered_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_layered_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_gibbs.lo ../src/graph/inference/layers/graph_blockmodel_layers_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_gibbs.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_gibbs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_imp.lo ../src/graph/inference/layers/graph_blockmodel_layers_imp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_imp.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_imp.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_imp.cc:20: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_mcmc.lo ../src/graph/inference/layers/graph_blockmodel_layers_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_mcmc.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_multicanonical.lo ../src/graph/inference/layers/graph_blockmodel_layers_multicanonical.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_multicanonical.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_multicanonical.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_multicanonical.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_multicanonical_multiflip.lo ../src/graph/inference/layers/graph_blockmodel_layers_multicanonical_multiflip.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_multicanonical_multiflip.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_multicanonical_multiflip.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_multicanonical_multiflip.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_multiflip_mcmc.lo ../src/graph/inference/layers/graph_blockmodel_layers_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_multilevel_mcmc.lo ../src/graph/inference/layers/graph_blockmodel_layers_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/c++/14/bits/shared_ptr.h:53, from /usr/include/c++/14/memory:80, from /usr/include/boost/config/no_tr1/memory.hpp:21, from /usr/include/boost/get_pointer.hpp:14, from /usr/include/boost/python/object/pointer_holder.hpp:11, from /usr/include/boost/python/to_python_indirect.hpp:10, from /usr/include/boost/python/converter/arg_to_python.hpp:10, from /usr/include/boost/python/call.hpp:15, from /usr/include/boost/python/object_core.hpp:14, from /usr/include/boost/python/object.hpp:9, from ../src/graph/graph.hh:29, from ../src/graph/graph_tool.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap.cc:18: In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ In file included from ../src/graph/inference/layers/../overlap/../blockmodel/graph_blockmodel.hh:31, from ../src/graph/inference/layers/../overlap/graph_blockmodel_overlap_util.hh:24, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap.cc:23: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_exhaustive.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_exhaustive.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_exhaustive.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_exhaustive.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_exhaustive.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/inference/layers/../loops/exhaustive_loop.hh:22, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_exhaustive.cc:28: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_layered_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_layered_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_layered_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_layered_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_gibbs.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_gibbs.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_gibbs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc_bundled.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc_bundled.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc_bundled.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_mcmc_bundled.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc_bundled.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multicanonical.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical_multiflip.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical_multiflip.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical_multiflip.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multicanonical_multiflip.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical_multiflip.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_multiflip_mcmc.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_multilevel_mcmc.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_vacate.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_vacate.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_vacate.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_vacate.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_vacate.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/ranked/graph_ranked.lo ../src/graph/inference/ranked/graph_ranked.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/ranked/graph_ranked.cc -fPIC -DPIC -o src/graph/inference/ranked/.libs/graph_ranked.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/ranked/graph_ranked.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/c++/14/bits/shared_ptr.h:53, from /usr/include/c++/14/memory:80, from /usr/include/boost/config/no_tr1/memory.hpp:21, from /usr/include/boost/get_pointer.hpp:14, from /usr/include/boost/python/object/pointer_holder.hpp:11, from /usr/include/boost/python/to_python_indirect.hpp:10, from /usr/include/boost/python/converter/arg_to_python.hpp:10, from /usr/include/boost/python/call.hpp:15, from /usr/include/boost/python/object_core.hpp:14, from /usr/include/boost/python/object.hpp:9, from ../src/graph/graph.hh:29, from ../src/graph/graph_tool.hh:21, from ../src/graph/inference/ranked/graph_ranked.cc:18: In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ In file included from ../src/graph/inference/ranked/graph_ranked.cc:23: ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/ranked/graph_ranked_mcmc.lo ../src/graph/inference/ranked/graph_ranked_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/ranked/graph_ranked_mcmc.cc -fPIC -DPIC -o src/graph/inference/ranked/.libs/graph_ranked_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/ranked/graph_ranked_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/ranked/graph_ranked_gibbs.lo ../src/graph/inference/ranked/graph_ranked_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/ranked/graph_ranked_gibbs.cc -fPIC -DPIC -o src/graph/inference/ranked/.libs/graph_ranked_gibbs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/ranked/graph_ranked_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/ranked/graph_ranked_multiflip_mcmc.lo ../src/graph/inference/ranked/graph_ranked_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/ranked/graph_ranked_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/ranked/.libs/graph_ranked_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/ranked/graph_ranked_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/ranked/graph_ranked_multilevel_mcmc.lo ../src/graph/inference/ranked/graph_ranked_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/ranked/graph_ranked_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/ranked/.libs/graph_ranked_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/ranked/graph_ranked_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics.lo ../src/graph/inference/uncertain/dynamics/dynamics.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics.cc:22: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_mcmc.lo ../src/graph/inference/uncertain/dynamics/dynamics_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_swap_mcmc.lo ../src/graph/inference/uncertain/dynamics/dynamics_swap_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_swap_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_swap_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_swap_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc.lo ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc_theta.lo ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc_theta.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc_theta.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_multiflip_mcmc_theta.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc_theta.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_mcmc_theta.lo ../src/graph/inference/uncertain/dynamics/dynamics_mcmc_theta.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_mcmc_theta.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_mcmc_theta.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_mcmc_theta.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc.lo ../src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_parallel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc_theta.lo ../src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc_theta.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc_theta.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_parallel_mcmc_theta.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc_theta.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_parallel_swap_mcmc.lo ../src/graph/inference/uncertain/dynamics/dynamics_parallel_swap_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_parallel_swap_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_parallel_swap_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_parallel_swap_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/cising_glauber/state.lo ../src/graph/inference/uncertain/dynamics/cising_glauber/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/cising_glauber/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/cising_glauber/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/cising_glauber/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/cising_glauber/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/epidemics/state.lo ../src/graph/inference/uncertain/dynamics/epidemics/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/epidemics/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/epidemics/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/epidemics/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/epidemics/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/epidemics/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/epidemics/../dynamics_discrete.hh:28, from ../src/graph/inference/uncertain/dynamics/epidemics/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/epidemics/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/ising_glauber/state.lo ../src/graph/inference/uncertain/dynamics/ising_glauber/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/ising_glauber/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/ising_glauber/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../dynamics_discrete.hh:28, from ../src/graph/inference/uncertain/dynamics/ising_glauber/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/ising_glauber/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/linear_normal/state.lo ../src/graph/inference/uncertain/dynamics/linear_normal/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/linear_normal/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/linear_normal/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/linear_normal/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/linear_normal/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/linear_normal/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/linear_normal/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/linear_normal/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/linear_normal/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/lotka_volterra/state.lo ../src/graph/inference/uncertain/dynamics/lotka_volterra/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/lotka_volterra/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/lotka_volterra/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/normal_glauber/state.lo ../src/graph/inference/uncertain/dynamics/normal_glauber/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/normal_glauber/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/normal_glauber/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/normal_glauber/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/normal_glauber/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/pseudo_cising/state.lo ../src/graph/inference/uncertain/dynamics/pseudo_cising/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/pseudo_cising/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/pseudo_cising/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/pseudo_ising/state.lo ../src/graph/inference/uncertain/dynamics/pseudo_ising/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/pseudo_ising/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/pseudo_ising/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../dynamics_discrete.hh:28, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/pseudo_normal/state.lo ../src/graph/inference/uncertain/dynamics/pseudo_normal/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/pseudo_normal/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/pseudo_normal/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/latent_closure.lo ../src/graph/inference/uncertain/latent_closure.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/latent_closure.cc -fPIC -DPIC -o src/graph/inference/uncertain/.libs/latent_closure.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/latent_closure.cc:20: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/c++/14/bits/shared_ptr.h:53, from /usr/include/c++/14/memory:80, from /usr/include/boost/config/no_tr1/memory.hpp:21, from /usr/include/boost/get_pointer.hpp:14, from /usr/include/boost/python/object/pointer_holder.hpp:11, from /usr/include/boost/python/to_python_indirect.hpp:10, from /usr/include/boost/python/converter/arg_to_python.hpp:10, from /usr/include/boost/python/call.hpp:15, from /usr/include/boost/python/object_core.hpp:14, from /usr/include/boost/python/object.hpp:9, from ../src/graph/graph.hh:29, from ../src/graph/graph_tool.hh:21, from ../src/graph/inference/uncertain/latent_closure.cc:19: In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ In file included from ../src/graph/inference/uncertain/../blockmodel/graph_blockmodel.hh:31, from ../src/graph/inference/uncertain/latent_closure.cc:24: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/latent_closure_mcmc.lo ../src/graph/inference/uncertain/latent_closure_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/latent_closure_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/.libs/latent_closure_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/latent_closure_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/measured.lo ../src/graph/inference/uncertain/measured.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/measured.cc -fPIC -DPIC -o src/graph/inference/uncertain/.libs/measured.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/measured.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/measured_mcmc.lo ../src/graph/inference/uncertain/measured_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/measured_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/.libs/measured_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/measured_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/uncertain.lo ../src/graph/inference/uncertain/uncertain.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/uncertain.cc -fPIC -DPIC -o src/graph/inference/uncertain/.libs/uncertain.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/uncertain.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/uncertain_marginal.lo ../src/graph/inference/uncertain/uncertain_marginal.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/uncertain_marginal.cc -fPIC -DPIC -o src/graph/inference/uncertain/.libs/uncertain_marginal.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/../blockmodel/../../generation/sampler.hh:21, from ../src/graph/inference/uncertain/../blockmodel/graph_blockmodel_elist.hh:21, from ../src/graph/inference/uncertain/../blockmodel/graph_blockmodel_util.hh:29, from ../src/graph/inference/uncertain/uncertain_marginal.hh:24, from ../src/graph/inference/uncertain/uncertain_marginal.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/uncertain_mcmc.lo ../src/graph/inference/uncertain/uncertain_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/uncertain_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/.libs/uncertain_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/uncertain_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/support/cache.lo ../src/graph/inference/support/cache.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/support/cache.cc -fPIC -DPIC -o src/graph/inference/support/.libs/cache.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/support/int_part.lo ../src/graph/inference/support/int_part.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/support/int_part.cc -fPIC -DPIC -o src/graph/inference/support/.libs/int_part.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/support/spence.lo ../src/graph/inference/support/spence.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/support/spence.cc -fPIC -DPIC -o src/graph/inference/support/.libs/spence.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/graph_inference.lo ../src/graph/inference/graph_inference.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/graph_inference.cc -fPIC -DPIC -o src/graph/inference/.libs/graph_inference.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/graph_inference.cc:23: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/graph_latent_multigraph.lo ../src/graph/inference/graph_latent_multigraph.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/graph_latent_multigraph.cc -fPIC -DPIC -o src/graph/inference/.libs/graph_latent_multigraph.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/graph_modularity.lo ../src/graph/inference/graph_modularity.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/graph_modularity.cc -fPIC -DPIC -o src/graph/inference/.libs/graph_modularity.o /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_inference_fast.la src/graph/inference/uncertain/dynamics/epidemics/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/cising_glauber/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/ising_glauber/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/pseudo_cising/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/pseudo_ising/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/pseudo_normal/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/linear_normal/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/lotka_volterra/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/normal_glauber/libgraph_tool_inference_fast_la-base_vec.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp copying selected object files to avoid basename conflicts... libtool: link: ln src/graph/inference/uncertain/dynamics/cising_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt1-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/cising_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt1-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ln src/graph/inference/uncertain/dynamics/ising_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt2-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/ising_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt2-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ln src/graph/inference/uncertain/dynamics/pseudo_cising/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt3-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/pseudo_cising/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt3-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ln src/graph/inference/uncertain/dynamics/pseudo_ising/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt4-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/pseudo_ising/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt4-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ln src/graph/inference/uncertain/dynamics/pseudo_normal/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt5-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/pseudo_normal/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt5-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ln src/graph/inference/uncertain/dynamics/linear_normal/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt6-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/linear_normal/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt6-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ln src/graph/inference/uncertain/dynamics/lotka_volterra/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt7-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/lotka_volterra/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt7-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ln src/graph/inference/uncertain/dynamics/normal_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt8-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/normal_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt8-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ar cr .libs/libgraph_tool_inference_fast.a src/graph/inference/uncertain/dynamics/epidemics/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt1-libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt2-libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt3-libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt4-libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt5-libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt6-libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt7-libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt8-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ranlib .libs/libgraph_tool_inference_fast.a libtool: link: rm -fr .libs/libgraph_tool_inference_fast.lax libtool: link: ( cd ".libs" && rm -f "libgraph_tool_inference_fast.la" && ln -s "../libgraph_tool_inference_fast.la" "libgraph_tool_inference_fast.la" ) /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/layout/graph_arf.lo ../src/graph/layout/graph_arf.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/layout/graph_arf.cc -fPIC -DPIC -o src/graph/layout/.libs/graph_arf.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/layout/graph_planar_layout.lo ../src/graph/layout/graph_planar_layout.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/layout/graph_planar_layout.cc -fPIC -DPIC -o src/graph/layout/.libs/graph_planar_layout.o In file included from /usr/include/c++/14/iterator:63, from ../src/graph/graph.hh:23, from ../src/graph/graph_filtering.hh:21, from ../src/graph/layout/graph_planar_layout.cc:18: In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::chrobak_payne_straight_line_drawing(const Graph&, PlanarEmbedding, ForwardIterator, ForwardIterator, GridPositionMap, VertexIndexMap) [with Graph = filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; PlanarEmbedding = unchecked_vector_property_map, std::allocator > >, typed_identity_property_map >; ForwardIterator = __gnu_cxx::__normal_iterator >; GridPositionMap = unchecked_vector_property_map >; VertexIndexMap = typed_identity_property_map]' at /usr/include/boost/graph/chrobak_payne_drawing.hpp:214:18: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'next_to_rightmost' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ In file included from ../src/graph/layout/graph_planar_layout.cc:22: /usr/include/boost/graph/chrobak_payne_drawing.hpp: In function 'void boost::chrobak_payne_straight_line_drawing(const Graph&, PlanarEmbedding, ForwardIterator, ForwardIterator, GridPositionMap, VertexIndexMap) [with Graph = filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; PlanarEmbedding = unchecked_vector_property_map, std::allocator > >, typed_identity_property_map >; ForwardIterator = __gnu_cxx::__normal_iterator >; GridPositionMap = unchecked_vector_property_map >; VertexIndexMap = typed_identity_property_map]': /usr/include/boost/graph/chrobak_payne_drawing.hpp:207:22: note: 'next_to_rightmost' was declared here 207 | vertex_t next_to_rightmost; | ^~~~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::chrobak_payne_straight_line_drawing(const Graph&, PlanarEmbedding, ForwardIterator, ForwardIterator, GridPositionMap, VertexIndexMap) [with Graph = undirected_adaptor >; PlanarEmbedding = unchecked_vector_property_map, std::allocator > >, typed_identity_property_map >; ForwardIterator = __gnu_cxx::__normal_iterator >; GridPositionMap = unchecked_vector_property_map >; VertexIndexMap = typed_identity_property_map]' at /usr/include/boost/graph/chrobak_payne_drawing.hpp:214:18: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'next_to_rightmost' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/chrobak_payne_drawing.hpp: In function 'void boost::chrobak_payne_straight_line_drawing(const Graph&, PlanarEmbedding, ForwardIterator, ForwardIterator, GridPositionMap, VertexIndexMap) [with Graph = undirected_adaptor >; PlanarEmbedding = unchecked_vector_property_map, std::allocator > >, typed_identity_property_map >; ForwardIterator = __gnu_cxx::__normal_iterator >; GridPositionMap = unchecked_vector_property_map >; VertexIndexMap = typed_identity_property_map]': /usr/include/boost/graph/chrobak_payne_drawing.hpp:207:22: note: 'next_to_rightmost' was declared here 207 | vertex_t next_to_rightmost; | ^~~~~~~~~~~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/layout/graph_fruchterman_reingold.lo ../src/graph/layout/graph_fruchterman_reingold.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/layout/graph_fruchterman_reingold.cc -fPIC -DPIC -o src/graph/layout/.libs/graph_fruchterman_reingold.o In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/layout/graph_sfdp.lo ../src/graph/layout/graph_sfdp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/layout/graph_sfdp.cc -fPIC -DPIC -o src/graph/layout/.libs/graph_sfdp.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/layout/../generation/sampler.hh:21, from ../src/graph/layout/graph_sfdp.hh:26, from ../src/graph/layout/graph_sfdp.cc:23: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/layout/graph_radial.lo ../src/graph/layout/graph_radial.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/layout/graph_radial.cc -fPIC -DPIC -o src/graph/layout/.libs/graph_radial.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/layout/graph_bind_layout.lo ../src/graph/layout/graph_bind_layout.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/layout/graph_bind_layout.cc -fPIC -DPIC -o src/graph/layout/.libs/graph_bind_layout.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/search/graph_bfs.lo ../src/graph/search/graph_bfs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/search/graph_bfs.cc -fPIC -DPIC -o src/graph/search/.libs/graph_bfs.o In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/search/graph_bfs.cc:19: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/search/graph_dfs.lo ../src/graph/search/graph_dfs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/search/graph_dfs.cc -fPIC -DPIC -o src/graph/search/.libs/graph_dfs.o In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/search/graph_dfs.cc:19: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/search/graph_dijkstra.lo ../src/graph/search/graph_dijkstra.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/search/graph_dijkstra.cc -fPIC -DPIC -o src/graph/search/.libs/graph_dijkstra.o In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/search/graph_dijkstra.cc:19: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16, inlined from 'boost::coroutines2::detail::pull_coroutine::~pull_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_coroutine.ipp:64:24, inlined from 'constexpr void std::_Destroy(_Tp*) [with _Tp = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/stl_construct.h:151:22, inlined from 'static void std::allocator_traits >::destroy(allocator_type&, _Up*) [with _Up = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/alloc_traits.h:720:17, inlined from 'void std::_Sp_counted_ptr_inplace<_Tp, _Alloc, _Lp>::_M_dispose() [with _Tp = boost::coroutines2::detail::pull_coroutine; _Alloc = std::allocator; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:616:35: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)MEM[(struct pull_coroutine *)this_2(D) + 16B].cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/search/graph_bellman_ford.lo ../src/graph/search/graph_bellman_ford.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/search/graph_bellman_ford.cc -fPIC -DPIC -o src/graph/search/.libs/graph_bellman_ford.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/search/graph_astar.lo ../src/graph/search/graph_astar.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/search/graph_astar.cc -fPIC -DPIC -o src/graph/search/.libs/graph_astar.o In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/search/graph_astar.cc:19: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16, inlined from 'boost::coroutines2::detail::pull_coroutine::~pull_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_coroutine.ipp:64:24, inlined from 'constexpr void std::_Destroy(_Tp*) [with _Tp = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/stl_construct.h:151:22, inlined from 'static void std::allocator_traits >::destroy(allocator_type&, _Up*) [with _Up = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/alloc_traits.h:720:17, inlined from 'void std::_Sp_counted_ptr_inplace<_Tp, _Alloc, _Lp>::_M_dispose() [with _Tp = boost::coroutines2::detail::pull_coroutine; _Alloc = std::allocator; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:616:35: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)MEM[(struct pull_coroutine *)this_2(D) + 16B].cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/search/graph_astar_implicit.lo ../src/graph/search/graph_astar_implicit.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/search/graph_astar_implicit.cc -fPIC -DPIC -o src/graph/search/.libs/graph_astar_implicit.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/search/graph_search_bind.lo ../src/graph/search/graph_search_bind.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/search/graph_search_bind.cc -fPIC -DPIC -o src/graph/search/.libs/graph_search_bind.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/spectral/graph_adjacency.lo ../src/graph/spectral/graph_adjacency.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/spectral/graph_adjacency.cc -fPIC -DPIC -o src/graph/spectral/.libs/graph_adjacency.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/spectral/graph_incidence.lo ../src/graph/spectral/graph_incidence.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/spectral/graph_incidence.cc -fPIC -DPIC -o src/graph/spectral/.libs/graph_incidence.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/spectral/graph_laplacian.lo ../src/graph/spectral/graph_laplacian.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/spectral/graph_laplacian.cc -fPIC -DPIC -o src/graph/spectral/.libs/graph_laplacian.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/spectral/graph_norm_laplacian.lo ../src/graph/spectral/graph_norm_laplacian.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/spectral/graph_norm_laplacian.cc -fPIC -DPIC -o src/graph/spectral/.libs/graph_norm_laplacian.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/spectral/graph_matrix.lo ../src/graph/spectral/graph_matrix.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/spectral/graph_matrix.cc -fPIC -DPIC -o src/graph/spectral/.libs/graph_matrix.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/spectral/graph_transition.lo ../src/graph/spectral/graph_transition.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/spectral/graph_transition.cc -fPIC -DPIC -o src/graph/spectral/.libs/graph_transition.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/spectral/graph_nonbacktracking.lo ../src/graph/spectral/graph_nonbacktracking.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/spectral/graph_nonbacktracking.cc -fPIC -DPIC -o src/graph/spectral/.libs/graph_nonbacktracking.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/stats/graph_histograms.lo ../src/graph/stats/graph_histograms.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/stats/graph_histograms.cc -fPIC -DPIC -o src/graph/stats/.libs/graph_histograms.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/stats/graph_average.lo ../src/graph/stats/graph_average.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/stats/graph_average.cc -fPIC -DPIC -o src/graph/stats/.libs/graph_average.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/stats/graph_distance.lo ../src/graph/stats/graph_distance.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/stats/graph_distance.cc -fPIC -DPIC -o src/graph/stats/.libs/graph_distance.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/stats/graph_distance_sampled.lo ../src/graph/stats/graph_distance_sampled.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/stats/graph_distance_sampled.cc -fPIC -DPIC -o src/graph/stats/.libs/graph_distance_sampled.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/stats/graph_distance_sampled.cc:25: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/stats/graph_stats_bind.lo ../src/graph/stats/graph_stats_bind.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/stats/graph_stats_bind.cc -fPIC -DPIC -o src/graph/stats/.libs/graph_stats_bind.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_all_circuits.lo ../src/graph/topology/graph_all_circuits.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_all_circuits.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_all_circuits.o In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/topology/graph_all_circuits.cc:22: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_all_distances.lo ../src/graph/topology/graph_all_distances.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_all_distances.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_all_distances.o In file included from /usr/include/boost/graph/detail/adjacency_list.hpp:35, from /usr/include/boost/graph/adjacency_list.hpp:255, from /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:30, from ../src/graph/topology/graph_all_distances.cc:25: In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:28: /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 104 | typename GTraits::edge_iterator i, end; | ^~~ In file included from /usr/include/c++/14/vector:66, from /usr/include/c++/14/functional:64, from /usr/include/boost/config/no_tr1/functional.hpp:21, from /usr/include/boost/function/detail/prologue.hpp:15, from /usr/include/boost/function/function_template.hpp:13, from /usr/include/boost/function/detail/maybe_include.hpp:15, from /usr/include/boost/function/function0.hpp:11, from /usr/include/boost/python/errors.hpp:13, from /usr/include/boost/python/handle.hpp:11, from /usr/include/boost/python/converter/arg_to_python_base.hpp:7, from /usr/include/boost/python/converter/arg_to_python.hpp:14, from /usr/include/boost/python/call.hpp:15, from /usr/include/boost/python/object_core.hpp:14, from /usr/include/boost/python/object.hpp:9, from ../src/graph/graph.hh:29, from ../src/graph/topology/graph_all_distances.cc:18: In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::operator[](size_type) [with _Tp = boost::detail::adj_list_gen, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex; _Alloc = std::allocator, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex>]', inlined from 'Reference boost::vec_adj_list_vertex_property_map::operator[](key_type) const [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; GraphPtr = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*; ValueType = unsigned char; Reference = unsigned char&; Tag = boost::vertex_distance_t]' at /usr/include/boost/graph/detail/adjacency_list.hpp:2560:50, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:125:32: /usr/include/c++/14/bits/stl_vector.h:1131:41: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1131 | return *(this->_M_impl._M_start + __n); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:51: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 104 | typename GTraits::edge_iterator i, end; | ^~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::operator[](size_type) [with _Tp = boost::detail::adj_list_gen, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex; _Alloc = std::allocator, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex>]', inlined from 'Reference boost::vec_adj_list_vertex_property_map::operator[](key_type) const [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; GraphPtr = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*; ValueType = short int; Reference = short int&; Tag = boost::vertex_distance_t]' at /usr/include/boost/graph/detail/adjacency_list.hpp:2560:50, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:125:32: /usr/include/c++/14/bits/stl_vector.h:1131:41: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1131 | return *(this->_M_impl._M_start + __n); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:51: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 104 | typename GTraits::edge_iterator i, end; | ^~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::operator[](size_type) [with _Tp = boost::detail::adj_list_gen, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex; _Alloc = std::allocator, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex>]', inlined from 'Reference boost::vec_adj_list_vertex_property_map::operator[](key_type) const [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; GraphPtr = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*; ValueType = int; Reference = int&; Tag = boost::vertex_distance_t]' at /usr/include/boost/graph/detail/adjacency_list.hpp:2560:50, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:125:32: /usr/include/c++/14/bits/stl_vector.h:1131:41: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1131 | return *(this->_M_impl._M_start + __n); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:51: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 104 | typename GTraits::edge_iterator i, end; | ^~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::operator[](size_type) [with _Tp = boost::detail::adj_list_gen, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex; _Alloc = std::allocator, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex>]', inlined from 'Reference boost::vec_adj_list_vertex_property_map::operator[](key_type) const [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; GraphPtr = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*; ValueType = long int; Reference = long int&; Tag = boost::vertex_distance_t]' at /usr/include/boost/graph/detail/adjacency_list.hpp:2560:50, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:125:32: /usr/include/c++/14/bits/stl_vector.h:1131:41: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1131 | return *(this->_M_impl._M_start + __n); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:51: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 104 | typename GTraits::edge_iterator i, end; | ^~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::operator[](size_type) [with _Tp = boost::detail::adj_list_gen, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex; _Alloc = std::allocator, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex>]', inlined from 'Reference boost::vec_adj_list_vertex_property_map::operator[](key_type) const [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; GraphPtr = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*; ValueType = double; Reference = double&; Tag = boost::vertex_distance_t]' at /usr/include/boost/graph/detail/adjacency_list.hpp:2560:50, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:125:32: /usr/include/c++/14/bits/stl_vector.h:1131:41: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1131 | return *(this->_M_impl._M_start + __n); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:51: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 104 | typename GTraits::edge_iterator i, end; | ^~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::operator[](size_type) [with _Tp = boost::detail::adj_list_gen, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex; _Alloc = std::allocator, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex>]', inlined from 'Reference boost::vec_adj_list_vertex_property_map::operator[](key_type) const [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; GraphPtr = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*; ValueType = long double; Reference = long double&; Tag = boost::vertex_distance_t]' at /usr/include/boost/graph/detail/adjacency_list.hpp:2560:50, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:125:32: /usr/include/c++/14/bits/stl_vector.h:1131:41: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1131 | return *(this->_M_impl._M_start + __n); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:51: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In file included from /usr/include/boost/property_map/shared_array_property_map.hpp:13, from /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:27: In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_bipartite.lo ../src/graph/topology/graph_bipartite.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_bipartite.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_bipartite.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_components.lo ../src/graph/topology/graph_components.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_components.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_components.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_distance.lo ../src/graph/topology/graph_distance.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_distance.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_distance.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/topology/../generation/sampler.hh:21, from ../src/graph/topology/graph_distance.cc:26: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/topology/graph_distance.cc:22: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16, inlined from 'boost::coroutines2::detail::pull_coroutine::~pull_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_coroutine.ipp:64:24, inlined from 'constexpr void std::_Destroy(_Tp*) [with _Tp = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/stl_construct.h:151:22, inlined from 'static void std::allocator_traits >::destroy(allocator_type&, _Up*) [with _Up = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/alloc_traits.h:720:17, inlined from 'void std::_Sp_counted_ptr_inplace<_Tp, _Alloc, _Lp>::_M_dispose() [with _Tp = boost::coroutines2::detail::pull_coroutine; _Alloc = std::allocator; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:616:35: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)MEM[(struct pull_coroutine *)this_2(D) + 16B].cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_diameter.lo ../src/graph/topology/graph_diameter.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_diameter.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_diameter.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_dominator_tree.lo ../src/graph/topology/graph_dominator_tree.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_dominator_tree.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_dominator_tree.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_isomorphism.lo ../src/graph/topology/graph_isomorphism.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_isomorphism.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_isomorphism.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_kcore.lo ../src/graph/topology/graph_kcore.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_kcore.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_kcore.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_matching.lo ../src/graph/topology/graph_matching.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_matching.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_matching.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_maximal_cliques.lo ../src/graph/topology/graph_maximal_cliques.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_maximal_cliques.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_maximal_cliques.o In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/topology/graph_maximal_cliques.cc:20: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_maximal_planar.lo ../src/graph/topology/graph_maximal_planar.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_maximal_planar.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_maximal_planar.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_maximal_vertex_set.lo ../src/graph/topology/graph_maximal_vertex_set.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_maximal_vertex_set.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_maximal_vertex_set.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/topology/graph_maximal_vertex_set.cc:24: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_minimum_spanning_tree.lo ../src/graph/topology/graph_minimum_spanning_tree.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_minimum_spanning_tree.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_minimum_spanning_tree.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_percolation.lo ../src/graph/topology/graph_percolation.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_percolation.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_percolation.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_planar.lo ../src/graph/topology/graph_planar.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_planar.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_planar.o In file included from /usr/include/c++/14/iterator:63, from ../src/graph/graph.hh:23, from ../src/graph/graph_filtering.hh:21, from ../src/graph/topology/graph_planar.cc:18: In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ In file included from /usr/include/boost/graph/boyer_myrvold_planar_test.hpp:12, from ../src/graph/topology/graph_planar.cc:22: /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_random_matching.lo ../src/graph/topology/graph_random_matching.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_random_matching.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_random_matching.o In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/topology/graph_random_matching.cc:24: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52, inlined from 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]' at /usr/include/boost/graph/boyer_myrvold_planar_test.hpp:106:61: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]', inlined from 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]' at /usr/include/boost/graph/boyer_myrvold_planar_test.hpp:106:61: /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1264:9: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1264 | if (bicomp_root != v) | ^~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52, inlined from 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::false_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple, std::allocator > >, boost::typed_identity_property_map > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]' at /usr/include/boost/graph/boyer_myrvold_planar_test.hpp:193:61: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::false_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple, std::allocator > >, boost::typed_identity_property_map > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]', inlined from 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::false_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple, std::allocator > >, boost::typed_identity_property_map > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]' at /usr/include/boost/graph/boyer_myrvold_planar_test.hpp:193:61: /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1264:9: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1264 | if (bicomp_root != v) | ^~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::false_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple, std::allocator > >, boost::typed_identity_property_map > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_random_spanning_tree.lo ../src/graph/topology/graph_random_spanning_tree.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_random_spanning_tree.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_random_spanning_tree.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_reciprocity.lo ../src/graph/topology/graph_reciprocity.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_reciprocity.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_reciprocity.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/topology/graph_random_spanning_tree.cc:22: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_sequential_color.lo ../src/graph/topology/graph_sequential_color.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_sequential_color.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_sequential_color.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_similarity.lo ../src/graph/topology/graph_similarity.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_similarity.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_similarity.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_similarity_imp.lo ../src/graph/topology/graph_similarity_imp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_similarity_imp.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_similarity_imp.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_subgraph_isomorphism.lo ../src/graph/topology/graph_subgraph_isomorphism.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_subgraph_isomorphism.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_subgraph_isomorphism.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/topology/graph_subgraph_isomorphism.cc:20: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/topology/graph_subgraph_isomorphism.cc:21: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_topological_sort.lo ../src/graph/topology/graph_topological_sort.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_topological_sort.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_topological_sort.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_topology.lo ../src/graph/topology/graph_topology.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_topology.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_topology.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_tsp.lo ../src/graph/topology/graph_tsp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_tsp.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_tsp.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_transitive_closure.lo ../src/graph/topology/graph_transitive_closure.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_transitive_closure.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_transitive_closure.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_vertex_similarity.lo ../src/graph/topology/graph_vertex_similarity.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_vertex_similarity.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_vertex_similarity.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/util/graph_search.lo ../src/graph/util/graph_search.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/util/graph_search.cc -fPIC -DPIC -o src/graph/util/.libs/graph_search.o In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/util/graph_util_bind.lo ../src/graph/util/graph_util_bind.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/util/graph_util_bind.cc -fPIC -DPIC -o src/graph/util/.libs/graph_util_bind.o /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -lcairomm-1.0 -lsigc-2.0 -lcairo -Wl,-z,relro -Wl,-z,now -o libgt_pycairo_aux.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/draw src/graph/draw/libgt_pycairo_aux_la-pycairo_aux.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/draw/.libs/libgt_pycairo_aux_la-pycairo_aux.o -lcairomm-1.0 -lsigc-2.0 -lcairo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgt_pycairo_aux.so -o .libs/libgt_pycairo_aux.so libtool: link: ( cd ".libs" && rm -f "libgt_pycairo_aux.la" && ln -s "../libgt_pycairo_aux.la" "libgt_pycairo_aux.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_centrality.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/centrality src/graph/centrality/graph_betweenness.lo src/graph/centrality/graph_centrality_bind.lo src/graph/centrality/graph_closeness.lo src/graph/centrality/graph_eigentrust.lo src/graph/centrality/graph_eigenvector.lo src/graph/centrality/graph_hits.lo src/graph/centrality/graph_katz.lo src/graph/centrality/graph_pagerank.lo src/graph/centrality/graph_trust_transitivity.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/centrality/.libs/graph_betweenness.o src/graph/centrality/.libs/graph_centrality_bind.o src/graph/centrality/.libs/graph_closeness.o src/graph/centrality/.libs/graph_eigentrust.o src/graph/centrality/.libs/graph_eigenvector.o src/graph/centrality/.libs/graph_hits.o src/graph/centrality/.libs/graph_katz.o src/graph/centrality/.libs/graph_pagerank.o src/graph/centrality/.libs/graph_trust_transitivity.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_centrality.so -o .libs/libgraph_tool_centrality.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_centrality.la" && ln -s "../libgraph_tool_centrality.la" "libgraph_tool_centrality.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_clustering.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/clustering src/graph/clustering/graph_clustering.lo src/graph/clustering/graph_extended_clustering.lo src/graph/clustering/graph_motifs.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/clustering/.libs/graph_clustering.o src/graph/clustering/.libs/graph_extended_clustering.o src/graph/clustering/.libs/graph_motifs.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_clustering.so -o .libs/libgraph_tool_clustering.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_clustering.la" && ln -s "../libgraph_tool_clustering.la" "libgraph_tool_clustering.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_core.la -rpath /usr/lib/python3.13/dist-packages/graph_tool src/graph/base64.lo src/graph/demangle.lo src/graph/graph.lo src/graph/graph_exceptions.lo src/graph/graph_bind.lo src/graph/graph_copy.lo src/graph/graph_filtering.lo src/graph/graph_io.lo src/graph/graph_openmp.lo src/graph/graph_properties.lo src/graph/graph_properties_imp1.lo src/graph/graph_properties_imp2.lo src/graph/graph_properties_imp3.lo src/graph/graph_properties_imp4.lo src/graph/graph_properties_copy.lo src/graph/graph_properties_copy_imp1.lo src/graph/graph_properties_group.lo src/graph/graph_properties_ungroup.lo src/graph/graph_properties_map_values.lo src/graph/graph_properties_map_values_imp1.lo src/graph/graph_python_interface.lo src/graph/graph_python_interface_imp1.lo src/graph/graph_python_interface_export.lo src/graph/graph_selectors.lo src/graph/graphml.lo src/graph/openmp.lo src/graph/random.lo src/graph/read_graphviz_new.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/.libs/base64.o src/graph/.libs/demangle.o src/graph/.libs/graph.o src/graph/.libs/graph_exceptions.o src/graph/.libs/graph_bind.o src/graph/.libs/graph_copy.o src/graph/.libs/graph_filtering.o src/graph/.libs/graph_io.o src/graph/.libs/graph_openmp.o src/graph/.libs/graph_properties.o src/graph/.libs/graph_properties_imp1.o src/graph/.libs/graph_properties_imp2.o src/graph/.libs/graph_properties_imp3.o src/graph/.libs/graph_properties_imp4.o src/graph/.libs/graph_properties_copy.o src/graph/.libs/graph_properties_copy_imp1.o src/graph/.libs/graph_properties_group.o src/graph/.libs/graph_properties_ungroup.o src/graph/.libs/graph_properties_map_values.o src/graph/.libs/graph_properties_map_values_imp1.o src/graph/.libs/graph_python_interface.o src/graph/.libs/graph_python_interface_imp1.o src/graph/.libs/graph_python_interface_export.o src/graph/.libs/graph_selectors.o src/graph/.libs/graphml.o src/graph/.libs/openmp.o src/graph/.libs/random.o src/graph/.libs/read_graphviz_new.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_core.so -o .libs/libgraph_tool_core.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_core.la" && ln -s "../libgraph_tool_core.la" "libgraph_tool_core.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_correlations.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/correlations src/graph/correlations/graph_assortativity.lo src/graph/correlations/graph_correlations.lo src/graph/correlations/graph_correlations_imp1.lo src/graph/correlations/graph_avg_correlations.lo src/graph/correlations/graph_avg_correlations_imp1.lo src/graph/correlations/graph_avg_correlations_combined.lo src/graph/correlations/graph_correlations_combined.lo src/graph/correlations/graph_correlations_bind.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/correlations/.libs/graph_assortativity.o src/graph/correlations/.libs/graph_correlations.o src/graph/correlations/.libs/graph_correlations_imp1.o src/graph/correlations/.libs/graph_avg_correlations.o src/graph/correlations/.libs/graph_avg_correlations_imp1.o src/graph/correlations/.libs/graph_avg_correlations_combined.o src/graph/correlations/.libs/graph_correlations_combined.o src/graph/correlations/.libs/graph_correlations_bind.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_correlations.so -o .libs/libgraph_tool_correlations.so /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -lcairomm-1.0 -lsigc-2.0 -lcairo -Wl,-z,relro -Wl,-z,now -o libgraph_tool_draw.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/draw src/graph/draw/libgraph_tool_draw_la-graph_cairo_draw.lo src/graph/draw/libgraph_tool_draw_la-graph_tree_cts.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/draw/.libs/libgraph_tool_draw_la-graph_cairo_draw.o src/graph/draw/.libs/libgraph_tool_draw_la-graph_tree_cts.o -lcairomm-1.0 -lsigc-2.0 -lcairo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_draw.so -o .libs/libgraph_tool_draw.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_correlations.la" && ln -s "../libgraph_tool_correlations.la" "libgraph_tool_correlations.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_dynamics.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/dynamics src/graph/dynamics/graph_continuous.lo src/graph/dynamics/graph_discrete.lo src/graph/dynamics/graph_dynamics.lo src/graph/dynamics/graph_normal_bp.lo src/graph/dynamics/graph_potts_bp.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/dynamics/.libs/graph_continuous.o src/graph/dynamics/.libs/graph_discrete.o src/graph/dynamics/.libs/graph_dynamics.o src/graph/dynamics/.libs/graph_normal_bp.o src/graph/dynamics/.libs/graph_potts_bp.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_dynamics.so -o .libs/libgraph_tool_dynamics.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_draw.la" && ln -s "../libgraph_tool_draw.la" "libgraph_tool_draw.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_flow.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/flow src/graph/flow/graph_edmonds_karp.lo src/graph/flow/graph_push_relabel.lo src/graph/flow/graph_kolmogorov.lo src/graph/flow/graph_minimum_cut.lo src/graph/flow/graph_flow_bind.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/flow/.libs/graph_edmonds_karp.o src/graph/flow/.libs/graph_push_relabel.o src/graph/flow/.libs/graph_kolmogorov.o src/graph/flow/.libs/graph_minimum_cut.o src/graph/flow/.libs/graph_flow_bind.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_flow.so -o .libs/libgraph_tool_flow.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_dynamics.la" && ln -s "../libgraph_tool_dynamics.la" "libgraph_tool_dynamics.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_generation.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/generation src/graph/generation/libgraph_tool_generation_la-graph_community_network.lo src/graph/generation/libgraph_tool_generation_la-graph_community_network_eavg.lo src/graph/generation/libgraph_tool_generation_la-graph_community_network_eavg_imp1.lo src/graph/generation/libgraph_tool_generation_la-graph_community_network_edges.lo src/graph/generation/libgraph_tool_generation_la-graph_community_network_vavg.lo src/graph/generation/libgraph_tool_generation_la-graph_complete.lo src/graph/generation/libgraph_tool_generation_la-graph_contract_edges.lo src/graph/generation/libgraph_tool_generation_la-graph_generation.lo src/graph/generation/libgraph_tool_generation_la-graph_geometric.lo src/graph/generation/libgraph_tool_generation_la-graph_knn.lo src/graph/generation/libgraph_tool_generation_la-graph_lattice.lo src/graph/generation/libgraph_tool_generation_la-graph_line_graph.lo src/graph/generation/libgraph_tool_generation_la-graph_maxent_sbm.lo src/graph/generation/libgraph_tool_generation_la-graph_parallel.lo src/graph/generation/libgraph_tool_generation_la-graph_predecessor.lo src/graph/generation/libgraph_tool_generation_la-graph_price.lo src/graph/generation/libgraph_tool_generation_la-graph_random_edges.lo src/graph/generation/libgraph_tool_generation_la-graph_rewiring.lo src/graph/generation/libgraph_tool_generation_la-graph_sbm.lo src/graph/generation/libgraph_tool_generation_la-graph_triadic_closure.lo src/graph/generation/libgraph_tool_generation_la-graph_triangulation.lo src/graph/generation/libgraph_tool_generation_la-graph_union.lo src/graph/generation/libgraph_tool_generation_la-graph_union_eprop.lo src/graph/generation/libgraph_tool_generation_la-graph_union_vprop.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_eavg.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_eavg_imp1.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_edges.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_vavg.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_complete.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_contract_edges.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_generation.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_geometric.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_knn.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_lattice.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_line_graph.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_maxent_sbm.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_parallel.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_predecessor.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_price.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_random_edges.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_rewiring.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_sbm.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_triadic_closure.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_triangulation.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_union.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_union_eprop.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_union_vprop.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_generation.so -o .libs/libgraph_tool_generation.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_flow.la" && ln -s "../libgraph_tool_flow.la" "libgraph_tool_flow.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_layout.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/draw src/graph/layout/graph_arf.lo src/graph/layout/graph_planar_layout.lo src/graph/layout/graph_fruchterman_reingold.lo src/graph/layout/graph_sfdp.lo src/graph/layout/graph_radial.lo src/graph/layout/graph_bind_layout.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/layout/.libs/graph_arf.o src/graph/layout/.libs/graph_planar_layout.o src/graph/layout/.libs/graph_fruchterman_reingold.o src/graph/layout/.libs/graph_sfdp.o src/graph/layout/.libs/graph_radial.o src/graph/layout/.libs/graph_bind_layout.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_layout.so -o .libs/libgraph_tool_layout.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_layout.la" && ln -s "../libgraph_tool_layout.la" "libgraph_tool_layout.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_search.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/search src/graph/search/graph_bfs.lo src/graph/search/graph_dfs.lo src/graph/search/graph_dijkstra.lo src/graph/search/graph_bellman_ford.lo src/graph/search/graph_astar.lo src/graph/search/graph_astar_implicit.lo src/graph/search/graph_search_bind.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/search/.libs/graph_bfs.o src/graph/search/.libs/graph_dfs.o src/graph/search/.libs/graph_dijkstra.o src/graph/search/.libs/graph_bellman_ford.o src/graph/search/.libs/graph_astar.o src/graph/search/.libs/graph_astar_implicit.o src/graph/search/.libs/graph_search_bind.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_search.so -o .libs/libgraph_tool_search.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_generation.la" && ln -s "../libgraph_tool_generation.la" "libgraph_tool_generation.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_spectral.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/spectral src/graph/spectral/graph_adjacency.lo src/graph/spectral/graph_incidence.lo src/graph/spectral/graph_laplacian.lo src/graph/spectral/graph_norm_laplacian.lo src/graph/spectral/graph_matrix.lo src/graph/spectral/graph_transition.lo src/graph/spectral/graph_nonbacktracking.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/spectral/.libs/graph_adjacency.o src/graph/spectral/.libs/graph_incidence.o src/graph/spectral/.libs/graph_laplacian.o src/graph/spectral/.libs/graph_norm_laplacian.o src/graph/spectral/.libs/graph_matrix.o src/graph/spectral/.libs/graph_transition.o src/graph/spectral/.libs/graph_nonbacktracking.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_spectral.so -o .libs/libgraph_tool_spectral.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_search.la" && ln -s "../libgraph_tool_search.la" "libgraph_tool_search.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_stats.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/stats src/graph/stats/graph_histograms.lo src/graph/stats/graph_average.lo src/graph/stats/graph_distance.lo src/graph/stats/graph_distance_sampled.lo src/graph/stats/graph_stats_bind.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/stats/.libs/graph_histograms.o src/graph/stats/.libs/graph_average.o src/graph/stats/.libs/graph_distance.o src/graph/stats/.libs/graph_distance_sampled.o src/graph/stats/.libs/graph_stats_bind.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_stats.so -o .libs/libgraph_tool_stats.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_spectral.la" && ln -s "../libgraph_tool_spectral.la" "libgraph_tool_spectral.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_topology.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/topology src/graph/topology/graph_all_circuits.lo src/graph/topology/graph_all_distances.lo src/graph/topology/graph_bipartite.lo src/graph/topology/graph_components.lo src/graph/topology/graph_distance.lo src/graph/topology/graph_diameter.lo src/graph/topology/graph_dominator_tree.lo src/graph/topology/graph_isomorphism.lo src/graph/topology/graph_kcore.lo src/graph/topology/graph_matching.lo src/graph/topology/graph_maximal_cliques.lo src/graph/topology/graph_maximal_planar.lo src/graph/topology/graph_maximal_vertex_set.lo src/graph/topology/graph_minimum_spanning_tree.lo src/graph/topology/graph_percolation.lo src/graph/topology/graph_planar.lo src/graph/topology/graph_random_matching.lo src/graph/topology/graph_random_spanning_tree.lo src/graph/topology/graph_reciprocity.lo src/graph/topology/graph_sequential_color.lo src/graph/topology/graph_similarity.lo src/graph/topology/graph_similarity_imp.lo src/graph/topology/graph_subgraph_isomorphism.lo src/graph/topology/graph_topological_sort.lo src/graph/topology/graph_topology.lo src/graph/topology/graph_tsp.lo src/graph/topology/graph_transitive_closure.lo src/graph/topology/graph_vertex_similarity.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/topology/.libs/graph_all_circuits.o src/graph/topology/.libs/graph_all_distances.o src/graph/topology/.libs/graph_bipartite.o src/graph/topology/.libs/graph_components.o src/graph/topology/.libs/graph_distance.o src/graph/topology/.libs/graph_diameter.o src/graph/topology/.libs/graph_dominator_tree.o src/graph/topology/.libs/graph_isomorphism.o src/graph/topology/.libs/graph_kcore.o src/graph/topology/.libs/graph_matching.o src/graph/topology/.libs/graph_maximal_cliques.o src/graph/topology/.libs/graph_maximal_planar.o src/graph/topology/.libs/graph_maximal_vertex_set.o src/graph/topology/.libs/graph_minimum_spanning_tree.o src/graph/topology/.libs/graph_percolation.o src/graph/topology/.libs/graph_planar.o src/graph/topology/.libs/graph_random_matching.o src/graph/topology/.libs/graph_random_spanning_tree.o src/graph/topology/.libs/graph_reciprocity.o src/graph/topology/.libs/graph_sequential_color.o src/graph/topology/.libs/graph_similarity.o src/graph/topology/.libs/graph_similarity_imp.o src/graph/topology/.libs/graph_subgraph_isomorphism.o src/graph/topology/.libs/graph_topological_sort.o src/graph/topology/.libs/graph_topology.o src/graph/topology/.libs/graph_tsp.o src/graph/topology/.libs/graph_transitive_closure.o src/graph/topology/.libs/graph_vertex_similarity.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_topology.so -o .libs/libgraph_tool_topology.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_stats.la" && ln -s "../libgraph_tool_stats.la" "libgraph_tool_stats.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_util.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/util src/graph/util/graph_search.lo src/graph/util/graph_util_bind.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/util/.libs/graph_search.o src/graph/util/.libs/graph_util_bind.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_util.so -o .libs/libgraph_tool_util.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_util.la" && ln -s "../libgraph_tool_util.la" "libgraph_tool_util.la" ) libtool: link: ( cd ".libs" && rm -f "libgraph_tool_topology.la" && ln -s "../libgraph_tool_topology.la" "libgraph_tool_topology.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_inference.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/inference src/graph/inference/blockmodel/graph_blockmodel.lo src/graph/inference/blockmodel/graph_blockmodel_em.lo src/graph/inference/blockmodel/graph_blockmodel_exhaustive.lo src/graph/inference/blockmodel/graph_blockmodel_gibbs.lo src/graph/inference/blockmodel/graph_blockmodel_imp.lo src/graph/inference/blockmodel/graph_blockmodel_imp2.lo src/graph/inference/blockmodel/graph_blockmodel_imp3.lo src/graph/inference/blockmodel/graph_blockmodel_marginals.lo src/graph/inference/blockmodel/graph_blockmodel_mcmc.lo src/graph/inference/blockmodel/graph_blockmodel_multicanonical.lo src/graph/inference/blockmodel/graph_blockmodel_multicanonical_multiflip.lo src/graph/inference/blockmodel/graph_blockmodel_multiflip_mcmc.lo src/graph/inference/blockmodel/graph_blockmodel_multilevel_mcmc.lo src/graph/inference/cliques/graph_clique_decomposition.lo src/graph/inference/histogram/graph_histogram.lo src/graph/inference/histogram/graph_histogram_mcmc.lo src/graph/inference/modularity/graph_modularity.lo src/graph/inference/modularity/graph_modularity_gibbs.lo src/graph/inference/modularity/graph_modularity_mcmc.lo src/graph/inference/modularity/graph_modularity_multiflip_mcmc.lo src/graph/inference/modularity/graph_modularity_multilevel_mcmc.lo src/graph/inference/norm_cut/graph_norm_cut.lo src/graph/inference/norm_cut/graph_norm_cut_gibbs.lo src/graph/inference/norm_cut/graph_norm_cut_mcmc.lo src/graph/inference/norm_cut/graph_norm_cut_multiflip_mcmc.lo src/graph/inference/norm_cut/graph_norm_cut_multilevel_mcmc.lo src/graph/inference/partition_centroid/graph_partition_centroid.lo src/graph/inference/partition_centroid/graph_partition_centroid_mcmc.lo src/graph/inference/partition_centroid/graph_partition_centroid_multiflip_mcmc.lo src/graph/inference/partition_centroid/graph_partition_centroid_multilevel_mcmc.lo src/graph/inference/partition_centroid/graph_partition_centroid_rmi.lo src/graph/inference/partition_centroid/graph_partition_centroid_rmi_mcmc.lo src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multiflip_mcmc.lo src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multilevel_mcmc.lo src/graph/inference/partition_modes/graph_partition_mode.lo src/graph/inference/partition_modes/graph_partition_mode_clustering.lo src/graph/inference/partition_modes/graph_partition_mode_clustering_mcmc.lo src/graph/inference/partition_modes/graph_partition_mode_clustering_multiflip_mcmc.lo src/graph/inference/partition_modes/graph_partition_mode_clustering_multilevel_mcmc.lo src/graph/inference/planted_partition/graph_planted_partition.lo src/graph/inference/planted_partition/graph_planted_partition_gibbs.lo src/graph/inference/planted_partition/graph_planted_partition_mcmc.lo src/graph/inference/planted_partition/graph_planted_partition_multiflip_mcmc.lo src/graph/inference/planted_partition/graph_planted_partition_multilevel_mcmc.lo src/graph/inference/overlap/graph_blockmodel_overlap.lo src/graph/inference/overlap/graph_blockmodel_overlap_exhaustive.lo src/graph/inference/overlap/graph_blockmodel_overlap_gibbs.lo src/graph/inference/overlap/graph_blockmodel_overlap_mcmc.lo src/graph/inference/overlap/graph_blockmodel_overlap_mcmc_bundled.lo src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical.lo src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical_multiflip.lo src/graph/inference/overlap/graph_blockmodel_overlap_multiflip_mcmc.lo src/graph/inference/overlap/graph_blockmodel_overlap_multilevel_mcmc.lo src/graph/inference/overlap/graph_blockmodel_overlap_vacate.lo src/graph/inference/layers/graph_blockmodel_layers.lo src/graph/inference/layers/graph_blockmodel_layers_exhaustive.lo src/graph/inference/layers/graph_blockmodel_layers_gibbs.lo src/graph/inference/layers/graph_blockmodel_layers_imp.lo src/graph/inference/layers/graph_blockmodel_layers_mcmc.lo src/graph/inference/layers/graph_blockmodel_layers_multicanonical.lo src/graph/inference/layers/graph_blockmodel_layers_multicanonical_multiflip.lo src/graph/inference/layers/graph_blockmodel_layers_multiflip_mcmc.lo src/graph/inference/layers/graph_blockmodel_layers_multilevel_mcmc.lo src/graph/inference/layers/graph_blockmodel_layers_overlap.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_exhaustive.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_gibbs.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc_bundled.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical_multiflip.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_multiflip_mcmc.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_multilevel_mcmc.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_vacate.lo src/graph/inference/ranked/graph_ranked.lo src/graph/inference/ranked/graph_ranked_mcmc.lo src/graph/inference/ranked/graph_ranked_gibbs.lo src/graph/inference/ranked/graph_ranked_multiflip_mcmc.lo src/graph/inference/ranked/graph_ranked_multilevel_mcmc.lo src/graph/inference/uncertain/dynamics/dynamics.lo src/graph/inference/uncertain/dynamics/dynamics_mcmc.lo src/graph/inference/uncertain/dynamics/dynamics_swap_mcmc.lo src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc.lo src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc_theta.lo src/graph/inference/uncertain/dynamics/dynamics_mcmc_theta.lo src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc.lo src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc_theta.lo src/graph/inference/uncertain/dynamics/dynamics_parallel_swap_mcmc.lo src/graph/inference/uncertain/dynamics/cising_glauber/state.lo src/graph/inference/uncertain/dynamics/epidemics/state.lo src/graph/inference/uncertain/dynamics/ising_glauber/state.lo src/graph/inference/uncertain/dynamics/linear_normal/state.lo src/graph/inference/uncertain/dynamics/lotka_volterra/state.lo src/graph/inference/uncertain/dynamics/normal_glauber/state.lo src/graph/inference/uncertain/dynamics/pseudo_cising/state.lo src/graph/inference/uncertain/dynamics/pseudo_ising/state.lo src/graph/inference/uncertain/dynamics/pseudo_normal/state.lo src/graph/inference/uncertain/latent_closure.lo src/graph/inference/uncertain/latent_closure_mcmc.lo src/graph/inference/uncertain/measured.lo src/graph/inference/uncertain/measured_mcmc.lo src/graph/inference/uncertain/uncertain.lo src/graph/inference/uncertain/uncertain_marginal.lo src/graph/inference/uncertain/uncertain_mcmc.lo src/graph/inference/support/cache.lo src/graph/inference/support/int_part.lo src/graph/inference/support/spence.lo src/graph/inference/graph_inference.lo src/graph/inference/graph_latent_multigraph.lo src/graph/inference/graph_modularity.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat libgraph_tool_inference_fast.la -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/inference/blockmodel/.libs/graph_blockmodel.o src/graph/inference/blockmodel/.libs/graph_blockmodel_em.o src/graph/inference/blockmodel/.libs/graph_blockmodel_exhaustive.o src/graph/inference/blockmodel/.libs/graph_blockmodel_gibbs.o src/graph/inference/blockmodel/.libs/graph_blockmodel_imp.o src/graph/inference/blockmodel/.libs/graph_blockmodel_imp2.o src/graph/inference/blockmodel/.libs/graph_blockmodel_imp3.o src/graph/inference/blockmodel/.libs/graph_blockmodel_marginals.o src/graph/inference/blockmodel/.libs/graph_blockmodel_mcmc.o src/graph/inference/blockmodel/.libs/graph_blockmodel_multicanonical.o src/graph/inference/blockmodel/.libs/graph_blockmodel_multicanonical_multiflip.o src/graph/inference/blockmodel/.libs/graph_blockmodel_multiflip_mcmc.o src/graph/inference/blockmodel/.libs/graph_blockmodel_multilevel_mcmc.o src/graph/inference/cliques/.libs/graph_clique_decomposition.o src/graph/inference/histogram/.libs/graph_histogram.o src/graph/inference/histogram/.libs/graph_histogram_mcmc.o src/graph/inference/modularity/.libs/graph_modularity.o src/graph/inference/modularity/.libs/graph_modularity_gibbs.o src/graph/inference/modularity/.libs/graph_modularity_mcmc.o src/graph/inference/modularity/.libs/graph_modularity_multiflip_mcmc.o src/graph/inference/modularity/.libs/graph_modularity_multilevel_mcmc.o src/graph/inference/norm_cut/.libs/graph_norm_cut.o src/graph/inference/norm_cut/.libs/graph_norm_cut_gibbs.o src/graph/inference/norm_cut/.libs/graph_norm_cut_mcmc.o src/graph/inference/norm_cut/.libs/graph_norm_cut_multiflip_mcmc.o src/graph/inference/norm_cut/.libs/graph_norm_cut_multilevel_mcmc.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_mcmc.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_multiflip_mcmc.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_multilevel_mcmc.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi_mcmc.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi_multiflip_mcmc.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi_multilevel_mcmc.o src/graph/inference/partition_modes/.libs/graph_partition_mode.o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering.o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering_mcmc.o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering_multiflip_mcmc.o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering_multilevel_mcmc.o src/graph/inference/planted_partition/.libs/graph_planted_partition.o src/graph/inference/planted_partition/.libs/graph_planted_partition_gibbs.o src/graph/inference/planted_partition/.libs/graph_planted_partition_mcmc.o src/graph/inference/planted_partition/.libs/graph_planted_partition_multiflip_mcmc.o src/graph/inference/planted_partition/.libs/graph_planted_partition_multilevel_mcmc.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_exhaustive.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_gibbs.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_mcmc.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_mcmc_bundled.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multicanonical.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multicanonical_multiflip.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multiflip_mcmc.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multilevel_mcmc.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_vacate.o src/graph/inference/layers/.libs/graph_blockmodel_layers.o src/graph/inference/layers/.libs/graph_blockmodel_layers_exhaustive.o src/graph/inference/layers/.libs/graph_blockmodel_layers_gibbs.o src/graph/inference/layers/.libs/graph_blockmodel_layers_imp.o src/graph/inference/layers/.libs/graph_blockmodel_layers_mcmc.o src/graph/inference/layers/.libs/graph_blockmodel_layers_multicanonical.o src/graph/inference/layers/.libs/graph_blockmodel_layers_multicanonical_multiflip.o src/graph/inference/layers/.libs/graph_blockmodel_layers_multiflip_mcmc.o src/graph/inference/layers/.libs/graph_blockmodel_layers_multilevel_mcmc.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_exhaustive.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_gibbs.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_mcmc.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_mcmc_bundled.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multicanonical.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multicanonical_multiflip.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multiflip_mcmc.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multilevel_mcmc.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_vacate.o src/graph/inference/ranked/.libs/graph_ranked.o src/graph/inference/ranked/.libs/graph_ranked_mcmc.o src/graph/inference/ranked/.libs/graph_ranked_gibbs.o src/graph/inference/ranked/.libs/graph_ranked_multiflip_mcmc.o src/graph/inference/ranked/.libs/graph_ranked_multilevel_mcmc.o src/graph/inference/uncertain/dynamics/.libs/dynamics.o src/graph/inference/uncertain/dynamics/.libs/dynamics_mcmc.o src/graph/inference/uncertain/dynamics/.libs/dynamics_swap_mcmc.o src/graph/inference/uncertain/dynamics/.libs/dynamics_multiflip_mcmc.o src/graph/inference/uncertain/dynamics/.libs/dynamics_multiflip_mcmc_theta.o src/graph/inference/uncertain/dynamics/.libs/dynamics_mcmc_theta.o src/graph/inference/uncertain/dynamics/.libs/dynamics_parallel_mcmc.o src/graph/inference/uncertain/dynamics/.libs/dynamics_parallel_mcmc_theta.o src/graph/inference/uncertain/dynamics/.libs/dynamics_parallel_swap_mcmc.o src/graph/inference/uncertain/dynamics/cising_glauber/.libs/state.o src/graph/inference/uncertain/dynamics/epidemics/.libs/state.o src/graph/inference/uncertain/dynamics/ising_glauber/.libs/state.o src/graph/inference/uncertain/dynamics/linear_normal/.libs/state.o src/graph/inference/uncertain/dynamics/lotka_volterra/.libs/state.o src/graph/inference/uncertain/dynamics/normal_glauber/.libs/state.o src/graph/inference/uncertain/dynamics/pseudo_cising/.libs/state.o src/graph/inference/uncertain/dynamics/pseudo_ising/.libs/state.o src/graph/inference/uncertain/dynamics/pseudo_normal/.libs/state.o src/graph/inference/uncertain/.libs/latent_closure.o src/graph/inference/uncertain/.libs/latent_closure_mcmc.o src/graph/inference/uncertain/.libs/measured.o src/graph/inference/uncertain/.libs/measured_mcmc.o src/graph/inference/uncertain/.libs/uncertain.o src/graph/inference/uncertain/.libs/uncertain_marginal.o src/graph/inference/uncertain/.libs/uncertain_mcmc.o src/graph/inference/support/.libs/cache.o src/graph/inference/support/.libs/int_part.o src/graph/inference/support/.libs/spence.o src/graph/inference/.libs/graph_inference.o src/graph/inference/.libs/graph_latent_multigraph.o src/graph/inference/.libs/graph_modularity.o -Wl,--whole-archive ./.libs/libgraph_tool_inference_fast.a -Wl,--no-whole-archive -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_inference.so -o .libs/libgraph_tool_inference.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_inference.la" && ln -s "../libgraph_tool_inference.la" "libgraph_tool_inference.la" ) make[3]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' make[2]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' make[1]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds' rm -f debian/graph-tool-doc.debhelper.log debian/python3-graph-tool.debhelper.log debian/rules override_dh_auto_test make[1]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds' true make[1]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds' create-stamp debian/debhelper-build-stamp dh_testroot -O--builddirectory=_BUILD dh_prep -O--builddirectory=_BUILD rm -f -- debian/python3-graph-tool.substvars debian/graph-tool-doc.substvars rm -fr -- debian/.debhelper/generated/python3-graph-tool/ debian/python3-graph-tool/ debian/tmp/ debian/.debhelper/generated/graph-tool-doc/ debian/graph-tool-doc/ debian/rules override_dh_auto_install make[1]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds' dh_auto_install install -m0755 -d /build/reproducible-path/graph-tool-2.77\+ds/debian/tmp cd _BUILD && make -j1 install DESTDIR=/build/reproducible-path/graph-tool-2.77\+ds/debian/tmp AM_UPDATE_INFO_DIR=no make[2]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' make[3]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' make[3]: Nothing to be done for 'install-exec-am'. /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference' /usr/bin/install -c -m 644 ../src/graph/inference/graph_modularity.hh ../src/graph/inference/graph_latent_multigraph.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/blockmodel' /usr/bin/install -c -m 644 ../src/graph/inference/blockmodel/graph_blockmodel.hh ../src/graph/inference/blockmodel/graph_blockmodel_em.hh ../src/graph/inference/blockmodel/graph_blockmodel_emat.hh ../src/graph/inference/blockmodel/graph_blockmodel_elist.hh ../src/graph/inference/blockmodel/graph_blockmodel_entries.hh ../src/graph/inference/blockmodel/graph_blockmodel_entropy.hh ../src/graph/inference/blockmodel/graph_blockmodel_exhaustive.hh ../src/graph/inference/blockmodel/graph_blockmodel_gibbs.hh ../src/graph/inference/blockmodel/graph_blockmodel_mcmc.hh ../src/graph/inference/blockmodel/graph_blockmodel_multicanonical.hh ../src/graph/inference/blockmodel/graph_blockmodel_multiflip_mcmc.hh ../src/graph/inference/blockmodel/graph_blockmodel_multilevel_mcmc.hh ../src/graph/inference/blockmodel/graph_blockmodel_partition.hh ../src/graph/inference/blockmodel/graph_blockmodel_util.hh ../src/graph/inference/blockmodel/graph_blockmodel_weights.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/blockmodel' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/cliques' /usr/bin/install -c -m 644 ../src/graph/inference/cliques/graph_clique_decomposition.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/cliques' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/histogram' /usr/bin/install -c -m 644 ../src/graph/inference/histogram/graph_histogram.hh ../src/graph/inference/histogram/graph_histogram_mcmc.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/histogram' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/layers' /usr/bin/install -c -m 644 ../src/graph/inference/layers/graph_blockmodel_layers.hh ../src/graph/inference/layers/graph_blockmodel_layers_util.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/layers' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/loops' /usr/bin/install -c -m 644 ../src/graph/inference/loops/bundled_vacate_loop.hh ../src/graph/inference/loops/exhaustive_loop.hh ../src/graph/inference/loops/gibbs_loop.hh ../src/graph/inference/loops/mcmc_loop.hh ../src/graph/inference/loops/merge_split.hh ../src/graph/inference/loops/multilevel.hh ../src/graph/inference/loops/parallel_pseudo_mcmc.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/loops' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/modularity' /usr/bin/install -c -m 644 ../src/graph/inference/modularity/graph_modularity.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/modularity' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/norm_cut' /usr/bin/install -c -m 644 ../src/graph/inference/norm_cut/graph_norm_cut.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/norm_cut' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/overlap' /usr/bin/install -c -m 644 ../src/graph/inference/overlap/graph_blockmodel_overlap.hh ../src/graph/inference/overlap/graph_blockmodel_overlap_mcmc_bundled.hh ../src/graph/inference/overlap/graph_blockmodel_overlap_util.hh ../src/graph/inference/overlap/graph_blockmodel_overlap_vacate.hh ../src/graph/inference/overlap/graph_blockmodel_overlap_partition.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/overlap' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/partition_centroid' /usr/bin/install -c -m 644 ../src/graph/inference/partition_centroid/graph_partition_centroid.hh ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/partition_centroid' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/partition_modes' /usr/bin/install -c -m 644 ../src/graph/inference/partition_modes/graph_partition_mode.hh ../src/graph/inference/partition_modes/graph_partition_mode_clustering.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/partition_modes' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/planted_partition' /usr/bin/install -c -m 644 ../src/graph/inference/planted_partition/graph_planted_partition.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/planted_partition' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/ranked' /usr/bin/install -c -m 644 ../src/graph/inference/ranked/graph_ranked.hh ../src/graph/inference/ranked/graph_ranked_mcmc.hh ../src/graph/inference/ranked/graph_ranked_gibbs.hh ../src/graph/inference/ranked/graph_ranked_multiflip_mcmc.hh ../src/graph/inference/ranked/graph_ranked_multilevel_mcmc.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/ranked' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/support' /usr/bin/install -c -m 644 ../src/graph/inference/support/cache.hh ../src/graph/inference/support/contingency.hh ../src/graph/inference/support/fibonacci_search.hh ../src/graph/inference/support/graph_state.hh ../src/graph/inference/support/int_part.hh ../src/graph/inference/support/util.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/support' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/uncertain' /usr/bin/install -c -m 644 ../src/graph/inference/uncertain/dynamics/dynamics.hh ../src/graph/inference/uncertain/dynamics/dynamics_imp.hh ../src/graph/inference/uncertain/dynamics/dynamics_base.hh ../src/graph/inference/uncertain/dynamics/dynamics_base_imp.hh ../src/graph/inference/uncertain/dynamics/dynamics_continuous.hh ../src/graph/inference/uncertain/dynamics/dynamics_discrete.hh ../src/graph/inference/uncertain/dynamics/dynamics_mcmc.hh ../src/graph/inference/uncertain/dynamics/dynamics_swap_mcmc.hh ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc.hh ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc_theta.hh ../src/graph/inference/uncertain/dynamics/dynamics_mcmc_theta.hh ../src/graph/inference/uncertain/dynamics/dynamics_util.hh ../src/graph/inference/uncertain/dynamics/segment_sampler.hh ../src/graph/inference/uncertain/latent_closure.hh ../src/graph/inference/uncertain/latent_layers.hh ../src/graph/inference/uncertain/latent_layers_mcmc.hh ../src/graph/inference/uncertain/measured.hh ../src/graph/inference/uncertain/uncertain.hh ../src/graph/inference/uncertain/uncertain_marginal.hh ../src/graph/inference/uncertain/uncertain_mcmc.hh ../src/graph/inference/uncertain/uncertain_util.hh ../src/graph/inference/uncertain/sample_edge_sbm.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/uncertain' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/collection' /usr/bin/install -c -m 644 ../src/graph_tool/collection/atlas.dat.gz ../src/graph_tool/collection/adjnoun.gt.gz ../src/graph_tool/collection/as-22july06.gt.gz ../src/graph_tool/collection/astro-ph.gt.gz ../src/graph_tool/collection/celegansneural.gt.gz ../src/graph_tool/collection/cond-mat-2003.gt.gz ../src/graph_tool/collection/cond-mat-2005.gt.gz ../src/graph_tool/collection/cond-mat.gt.gz ../src/graph_tool/collection/dolphins.gt.gz ../src/graph_tool/collection/football.gt.gz ../src/graph_tool/collection/hep-th.gt.gz ../src/graph_tool/collection/karate.gt.gz ../src/graph_tool/collection/lesmis.gt.gz ../src/graph_tool/collection/netscience.gt.gz ../src/graph_tool/collection/polblogs.gt.gz ../src/graph_tool/collection/polbooks.gt.gz ../src/graph_tool/collection/power.gt.gz ../src/graph_tool/collection/pgp-strong-2009.gt.gz ../src/graph_tool/collection/serengeti-foodweb.gt.gz ../src/graph_tool/collection/email-Enron.gt.gz '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/collection' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' /usr/bin/install -c -m 644 ../src/graph_tool/draw/graph-tool-logo.svg '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool' /usr/bin/install -c -m 644 ../src/graph_tool/__init__.py ../src/graph_tool/all.py ../src/graph_tool/dl_import.py ../src/graph_tool/decorators.py ../src/graph_tool/gt_io.py ../src/graph_tool/openmp.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool' Byte-compiling python modules... __init__.pyall.pydl_import.pydecorators.pygt_io.pyopenmp.py Byte-compiling python modules (optimized versions) ... __init__.pyall.pydl_import.pydecorators.pygt_io.pyopenmp.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/centrality' /usr/bin/install -c -m 644 ../src/graph_tool/centrality/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/centrality' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/clustering' /usr/bin/install -c -m 644 ../src/graph_tool/clustering/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/clustering' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/collection' /usr/bin/install -c -m 644 ../src/graph_tool/collection/__init__.py ../src/graph_tool/collection/netzschleuder.py ../src/graph_tool/collection/small.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/collection' Byte-compiling python modules... __init__.pynetzschleuder.pysmall.py Byte-compiling python modules (optimized versions) ... __init__.pynetzschleuder.pysmall.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/correlations' /usr/bin/install -c -m 644 ../src/graph_tool/correlations/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/correlations' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' /usr/bin/install -c -m 644 ../src/graph_tool/draw/__init__.py ../src/graph_tool/draw/cairo_draw.py ../src/graph_tool/draw/gtk_draw.py ../src/graph_tool/draw/graphviz_draw.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' Byte-compiling python modules... __init__.pycairo_draw.pygtk_draw.pygraphviz_draw.py Byte-compiling python modules (optimized versions) ... __init__.pycairo_draw.pygtk_draw.pygraphviz_draw.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/dynamics' /usr/bin/install -c -m 644 ../src/graph_tool/dynamics/__init__.py ../src/graph_tool/dynamics/bp.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/dynamics' Byte-compiling python modules... __init__.pybp.py Byte-compiling python modules (optimized versions) ... __init__.pybp.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/flow' /usr/bin/install -c -m 644 ../src/graph_tool/flow/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/flow' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/generation' /usr/bin/install -c -m 644 ../src/graph_tool/generation/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/generation' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/inference' /usr/bin/install -c -m 644 ../src/graph_tool/inference/__init__.py ../src/graph_tool/inference/base_states.py ../src/graph_tool/inference/blockmodel.py ../src/graph_tool/inference/blockmodel_em.py ../src/graph_tool/inference/clique_decomposition.py ../src/graph_tool/inference/histogram.py ../src/graph_tool/inference/layered_blockmodel.py ../src/graph_tool/inference/nested_blockmodel.py ../src/graph_tool/inference/overlap_blockmodel.py ../src/graph_tool/inference/uncertain_blockmodel.py ../src/graph_tool/inference/reconstruction.py ../src/graph_tool/inference/mcmc.py ../src/graph_tool/inference/minimize.py ../src/graph_tool/inference/modularity.py ../src/graph_tool/inference/norm_cut.py ../src/graph_tool/inference/partition_centroid.py ../src/graph_tool/inference/partition_modes.py ../src/graph_tool/inference/planted_partition.py ../src/graph_tool/inference/ranked.py ../src/graph_tool/inference/latent_multigraph.py ../src/graph_tool/inference/latent_layers.py ../src/graph_tool/inference/util.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/inference' Byte-compiling python modules... __init__.pybase_states.pyblockmodel.pyblockmodel_em.pyclique_decomposition.pyhistogram.pylayered_blockmodel.pynested_blockmodel.pyoverlap_blockmodel.pyuncertain_blockmodel.pyreconstruction.pymcmc.pyminimize.pymodularity.pynorm_cut.pypartition_centroid.pypartition_modes.pyplanted_partition.pyranked.pylatent_multigraph.pylatent_layers.pyutil.py Byte-compiling python modules (optimized versions) ... __init__.pybase_states.pyblockmodel.pyblockmodel_em.pyclique_decomposition.pyhistogram.pylayered_blockmodel.pynested_blockmodel.pyoverlap_blockmodel.pyuncertain_blockmodel.pyreconstruction.pymcmc.pyminimize.pymodularity.pynorm_cut.pypartition_centroid.pypartition_modes.pyplanted_partition.pyranked.pylatent_multigraph.pylatent_layers.pyutil.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/search' /usr/bin/install -c -m 644 ../src/graph_tool/search/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/search' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/spectral' /usr/bin/install -c -m 644 ../src/graph_tool/spectral/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/spectral' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/stats' /usr/bin/install -c -m 644 ../src/graph_tool/stats/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/stats' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/topology' /usr/bin/install -c -m 644 ../src/graph_tool/topology/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/topology' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/util' /usr/bin/install -c -m 644 ../src/graph_tool/util/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/util' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/centrality' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_centrality.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/centrality' libtool: install: /usr/bin/install -c .libs/libgraph_tool_centrality.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/centrality/libgraph_tool_centrality.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_centrality.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/centrality/libgraph_tool_centrality.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/centrality' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/centrality' /usr/bin/install -c -m 644 ../src/graph/centrality/graph_closeness.hh ../src/graph/centrality/graph_eigentrust.hh ../src/graph/centrality/graph_eigenvector.hh ../src/graph/centrality/graph_pagerank.hh ../src/graph/centrality/graph_hits.hh ../src/graph/centrality/graph_katz.hh ../src/graph/centrality/graph_trust_transitivity.hh ../src/graph/centrality/minmax.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/centrality' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/clustering' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_clustering.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/clustering' libtool: install: /usr/bin/install -c .libs/libgraph_tool_clustering.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/clustering/libgraph_tool_clustering.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_clustering.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/clustering/libgraph_tool_clustering.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/clustering' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/clustering' /usr/bin/install -c -m 644 ../src/graph/clustering/graph_clustering.hh ../src/graph/clustering/graph_extended_clustering.hh ../src/graph/clustering/graph_motifs.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/clustering' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_core.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool' libtool: install: /usr/bin/install -c .libs/libgraph_tool_core.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/libgraph_tool_core.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_core.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/libgraph_tool_core.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include' /usr/bin/install -c -m 644 config.h ../src/graph/base64.hh ../src/graph/coroutine.hh ../src/graph/demangle.hh ../src/graph/fast_vector_property_map.hh ../src/graph/gml.hh ../src/graph/gil_release.hh ../src/graph/graph.hh ../src/graph/graph_adjacency.hh ../src/graph/graph_adaptor.hh ../src/graph/graph_exceptions.hh ../src/graph/graph_filtered.hh ../src/graph/graph_filtering.hh ../src/graph/graph_io_binary.hh ../src/graph/graph_properties.hh ../src/graph/graph_properties_copy.hh ../src/graph/graph_properties_group.hh ../src/graph/graph_properties_map_values.hh ../src/graph/graph_python_interface.hh ../src/graph/graph_reverse.hh ../src/graph/graph_selectors.hh ../src/graph/graph_tool.hh ../src/graph/graph_util.hh ../src/graph/hash_map_wrap.hh ../src/graph/histogram.hh ../src/graph/idx_map.hh ../src/graph/module_registry.hh ../src/graph/mpl_nested_loop.hh ../src/graph/numpy_bind.hh ../src/graph/openmp.hh ../src/graph/openmp_lock.hh ../src/graph/parallel_rng.hh ../src/graph/random.hh ../src/graph/str_repr.hh ../src/graph/shared_map.hh ../src/graph/shared_heap.hh ../src/graph/transform_iterator.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/pcg-cpp' /usr/bin/install -c -m 644 ../src/pcg-cpp/include/pcg_extras.hpp ../src/pcg-cpp/include/pcg_random.hpp ../src/pcg-cpp/include/pcg_uint128.hpp '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/pcg-cpp' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/boost-workaround/boost/graph/' /usr/bin/install -c -m 644 ../src/boost-workaround/boost/graph/adjacency_iterator.hpp ../src/boost-workaround/boost/graph/betweenness_centrality.hpp ../src/boost-workaround/boost/graph/detail/read_graphviz_new.hpp ../src/boost-workaround/boost/graph/graphml.hpp ../src/boost-workaround/boost/graph/graphviz.hpp ../src/boost-workaround/boost/graph/hawick_circuits.hpp ../src/boost-workaround/boost/graph/kamada_kawai_spring_layout.hpp ../src/boost-workaround/boost/graph/maximum_weighted_matching.hpp ../src/boost-workaround/boost/graph/metric_tsp_approx.hpp ../src/boost-workaround/boost/graph/named_function_params-alt.hpp ../src/boost-workaround/boost/graph/overloading.hpp ../src/boost-workaround/boost/graph/push_relabel_max_flow.hpp ../src/boost-workaround/boost/graph/copy_alt.hpp ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp ../src/boost-workaround/boost/graph/vf2_sub_graph_iso.hpp '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/boost-workaround/boost/graph/' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/correlations' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_correlations.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/correlations' libtool: install: /usr/bin/install -c .libs/libgraph_tool_correlations.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/correlations/libgraph_tool_correlations.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_correlations.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/correlations/libgraph_tool_correlations.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/correlations' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/correlations' /usr/bin/install -c -m 644 ../src/graph/correlations/graph_assortativity.hh ../src/graph/correlations/graph_correlations.hh ../src/graph/correlations/graph_corr_hist.hh ../src/graph/correlations/graph_avg_correlations.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/correlations' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_draw.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' libtool: install: /usr/bin/install -c .libs/libgraph_tool_draw.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/libgraph_tool_draw.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_draw.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/libgraph_tool_draw.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/draw' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/dynamics' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_dynamics.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/dynamics' libtool: install: /usr/bin/install -c .libs/libgraph_tool_dynamics.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/dynamics/libgraph_tool_dynamics.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_dynamics.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/dynamics/libgraph_tool_dynamics.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/dynamics' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/dynamics' /usr/bin/install -c -m 644 ../src/graph/dynamics/graph_continuous.hh ../src/graph/dynamics/graph_discrete.hh ../src/graph/dynamics/graph_normal_bp.hh ../src/graph/dynamics/graph_potts_bp.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/dynamics' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/flow' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_flow.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/flow' libtool: install: /usr/bin/install -c .libs/libgraph_tool_flow.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/flow/libgraph_tool_flow.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_flow.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/flow/libgraph_tool_flow.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/flow' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/flow' /usr/bin/install -c -m 644 ../src/graph/flow/graph_augment.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/flow' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/generation' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_generation.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/generation' libtool: install: /usr/bin/install -c .libs/libgraph_tool_generation.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/generation/libgraph_tool_generation.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_generation.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/generation/libgraph_tool_generation.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/generation' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/generation' /usr/bin/install -c -m 644 ../src/graph/generation/dynamic_sampler.hh ../src/graph/generation/graph_community_network.hh ../src/graph/generation/graph_complete.hh ../src/graph/generation/graph_contract_edges.hh ../src/graph/generation/graph_generation.hh ../src/graph/generation/graph_geometric.hh ../src/graph/generation/graph_knn.hh ../src/graph/generation/graph_lattice.hh ../src/graph/generation/graph_maxent_sbm.hh ../src/graph/generation/graph_parallel.hh ../src/graph/generation/graph_predecessor.hh ../src/graph/generation/graph_price.hh ../src/graph/generation/graph_random_edges.hh ../src/graph/generation/graph_rewiring.hh ../src/graph/generation/graph_sbm.hh ../src/graph/generation/graph_triadic_closure.hh ../src/graph/generation/graph_triangulation.hh ../src/graph/generation/graph_union.hh ../src/graph/generation/sampler.hh ../src/graph/generation/urn_sampler.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/generation' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/inference' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_inference.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/inference' libtool: install: /usr/bin/install -c .libs/libgraph_tool_inference.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/inference/libgraph_tool_inference.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_inference.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/inference/libgraph_tool_inference.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/inference' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_layout.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' libtool: install: /usr/bin/install -c .libs/libgraph_tool_layout.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/libgraph_tool_layout.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_layout.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/libgraph_tool_layout.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/draw' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/layout' /usr/bin/install -c -m 644 ../src/graph/layout/graph_arf.hh ../src/graph/layout/graph_sfdp.hh ../src/graph/layout/quad_tree.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/layout' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/search' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_search.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/search' libtool: install: /usr/bin/install -c .libs/libgraph_tool_search.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/search/libgraph_tool_search.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_search.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/search/libgraph_tool_search.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/search' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/spectral' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_spectral.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/spectral' libtool: install: /usr/bin/install -c .libs/libgraph_tool_spectral.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/spectral/libgraph_tool_spectral.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_spectral.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/spectral/libgraph_tool_spectral.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/spectral' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/spectral' /usr/bin/install -c -m 644 ../src/graph/spectral/graph_adjacency.hh ../src/graph/spectral/graph_incidence.hh ../src/graph/spectral/graph_laplacian.hh ../src/graph/spectral/graph_transition.hh ../src/graph/spectral/graph_nonbacktracking.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/spectral' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/stats' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_stats.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/stats' libtool: install: /usr/bin/install -c .libs/libgraph_tool_stats.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/stats/libgraph_tool_stats.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_stats.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/stats/libgraph_tool_stats.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/stats' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/stats' /usr/bin/install -c -m 644 ../src/graph/stats/graph_histograms.hh ../src/graph/stats/graph_average.hh ../src/graph/stats/graph_distance_sampled.hh ../src/graph/stats/graph_distance.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/stats' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/topology' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_topology.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/topology' libtool: install: /usr/bin/install -c .libs/libgraph_tool_topology.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/topology/libgraph_tool_topology.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_topology.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/topology/libgraph_tool_topology.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/topology' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/topology' /usr/bin/install -c -m 644 ../src/graph/topology/graph_bipartite_weighted_matching.hh ../src/graph/topology/graph_components.hh ../src/graph/topology/graph_kcore.hh ../src/graph/topology/graph_maximal_cliques.hh ../src/graph/topology/graph_percolation.hh ../src/graph/topology/graph_similarity.hh ../src/graph/topology/graph_vertex_similarity.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/topology' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/util' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_util.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/util' libtool: install: /usr/bin/install -c .libs/libgraph_tool_util.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/util/libgraph_tool_util.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_util.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/util/libgraph_tool_util.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/util' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/util' /usr/bin/install -c -m 644 ../src/graph/util/graph_search.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/util' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' /bin/bash ./libtool --mode=install /usr/bin/install -c libgt_pycairo_aux.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' libtool: install: /usr/bin/install -c .libs/libgt_pycairo_aux.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/libgt_pycairo_aux.so libtool: install: /usr/bin/install -c .libs/libgt_pycairo_aux.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/libgt_pycairo_aux.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/draw' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos' /usr/bin/install -c -m 644 ../doc/demos/index.rst '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/src/boost-workaround' /usr/bin/install -c -m 644 ../src/boost-workaround/LICENSE_1_0.txt '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/src/boost-workaround' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc' /usr/bin/install -c -m 644 ../doc/centrality.rst ../doc/correlations.rst ../doc/price.py ../doc/search_module.rst ../doc/util.rst ../doc/clustering.rst ../doc/draw.rst ../doc/index.rst ../doc/spectral.rst ../doc/inference.rst ../doc/flow.rst ../doc/Makefile ../doc/quickstart.rst ../doc/generation.rst ../doc/stats.rst ../doc/graph_tool.rst ../doc/modules.rst ../doc/parallel.rst ../doc/topology.rst ../doc/conf.py ../doc/pyenv.py ../doc/extlinks_fancy.py ../doc/search_example.xml ../doc/mincut-example.xml.gz ../doc/mincut-st-example.xml.gz '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/cppextensions' /usr/bin/install -c -m 644 ../doc/demos/cppextensions/Makefile ../doc/demos/cppextensions/cppextensions.rst ../doc/demos/cppextensions/kcore.cc ../doc/demos/cppextensions/kcore.hh ../doc/demos/cppextensions/kcore.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/cppextensions' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/inference' /usr/bin/install -c -m 644 ../doc/demos/inference/inference.rst ../doc/demos/inference/blockmodel-example.gt.gz ../doc/demos/inference/nested-diagram.svg '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/inference' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/_static' /usr/bin/install -c -m 644 ../doc/_static/graph-tool-logo.svg ../doc/_static/graph-tool-logo-circle.svg '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/_static' /usr/bin/install -c -m 644 ../README.md ../COPYING ../COPYING.LESSER ../AUTHORS ../INSTALL '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/.' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/animation' /usr/bin/install -c -m 644 ../doc/demos/animation/animation.rst ../doc/demos/animation/animation_dancing.py ../doc/demos/animation/animation_sirs.py ../doc/demos/animation/animation_zombies.py ../doc/demos/animation/interactive_bst.py ../doc/demos/animation/face-grin.png ../doc/demos/animation/face-surprise.png ../doc/demos/animation/zombie.png '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/animation' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/sphinxext' /usr/bin/install -c -m 644 ../doc/sphinxext/comment_eater.py ../doc/sphinxext/phantom_import.py ../doc/sphinxext/compiler_unparse.py ../doc/sphinxext/traitsdoc.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/sphinxext' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/matplotlib' /usr/bin/install -c -m 644 ../doc/demos/matplotlib/matplotlib.rst '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/matplotlib' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/x86_64-linux-gnu/pkgconfig' /usr/bin/install -c -m 644 graph-tool-py3.13.pc '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/x86_64-linux-gnu/pkgconfig' make[3]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' make[2]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' TEST STARTED Wed Feb 25 15:37:35 UTC 2026 rm -f _BUILD/test.png PYTHONPATH=/build/reproducible-path/graph-tool-2.77+ds/debian/tmp//usr/lib/python3.13/dist-packages \ python3 -c "\ from graph_tool.all import *; \ show_config(); \ g = random_graph(10, lambda: 5, directed=False); \ graph_draw(g, output='_BUILD/test.png'); \ " /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/cairo_draw.py:52: RuntimeWarning: Error importing matplotlib module. Graph drawing will not work. warnings.warn(msg, RuntimeWarning) /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/cairo_draw.py:52: RuntimeWarning: Error importing matplotlib module. Graph drawing will not work. warnings.warn(msg, RuntimeWarning) /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/all.py:39: RuntimeWarning: Error importing draw module, proceeding nevertheless: cannot import name 'Image' from 'PIL' (unknown location) warnings.warn(msg, RuntimeWarning) Traceback (most recent call last): File "", line 1, in from graph_tool.all import *; show_config(); g = random_graph(10, lambda: 5, directed=False); graph_draw(g, output='_BUILD/test.png'); ^^^^^^^^^^ NameError: name 'graph_draw' is not defined version: 2.77 gcc version: 14.2.0 compilation flags: -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wl,-z,relro -Wl,-z,now install prefix: /usr python dir: /usr/lib/python3.13/dist-packages graph filtering: True openmp: True uname: Linux infom02-amd64 6.11.10+bpo-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.11.10-1~bpo12+1 (2024-12-19) x86_64 make[1]: *** [debian/rules:59: override_dh_auto_install] Error 1 make[1]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds' make: *** [debian/rules:37: binary] Error 2 dpkg-buildpackage: error: debian/rules binary subprocess returned exit status 2 I: copying local configuration E: Failed autobuilding of package I: unmounting dev/ptmx filesystem I: unmounting dev/pts filesystem I: unmounting dev/shm filesystem I: unmounting proc filesystem I: unmounting sys filesystem I: cleaning the build env I: removing directory /srv/workspace/pbuilder/750065 and its subdirectories Starting cleanup. All cleanup done. Wed Feb 25 15:38:18 UTC 2026 - reproducible_build.sh stopped running as /tmp/jenkins-script-1JcE9bfB, removing. /srv/reproducible-results/rbuild-debian/r-b-build.ULgpyCNo: total 16 drwxr-xr-x 2 jenkins jenkins 4096 Jan 23 09:15 b1 drwxr-xr-x 2 jenkins jenkins 4096 Jan 23 01:11 b2 -rw-r--r-- 1 jenkins jenkins 2759 Dec 20 21:18 graph-tool_2.77+ds-3.dsc -rw------- 1 jenkins jenkins 3894 Jan 23 01:11 rbuildlog.eLr8W74 /srv/reproducible-results/rbuild-debian/r-b-build.ULgpyCNo/b1: total 23624 -rw-r--r-- 1 jenkins jenkins 24189445 Jan 23 09:15 build.log /srv/reproducible-results/rbuild-debian/r-b-build.ULgpyCNo/b2: total 0 Thu Jan 23 09:15:19 UTC 2025 I: Deleting $TMPDIR on infom02-amd64.debian.net. I: pbuilder: network access will be disabled during build I: Current time: Tue Feb 24 19:34:16 -12 2026 I: pbuilder-time-stamp: 1772004856 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/unstable-reproducible-base.tgz] I: copying local configuration W: --override-config is not set; not updating apt.conf Read the manpage for details. I: mounting /proc filesystem I: mounting /sys filesystem I: creating /{dev,run}/shm I: mounting /dev/pts filesystem I: redirecting /dev/ptmx to /dev/pts/ptmx I: policy-rc.d already exists I: Copying source file I: copying [graph-tool_2.77+ds-3.dsc] I: copying [./graph-tool_2.77+ds.orig.tar.xz] I: copying [./graph-tool_2.77+ds-3.debian.tar.xz] I: Extracting source dpkg-source: warning: cannot verify inline signature for ./graph-tool_2.77+ds-3.dsc: unsupported subcommand dpkg-source: info: extracting graph-tool in graph-tool-2.77+ds dpkg-source: info: unpacking graph-tool_2.77+ds.orig.tar.xz dpkg-source: info: unpacking graph-tool_2.77+ds-3.debian.tar.xz dpkg-source: info: using patch list from debian/patches/series dpkg-source: info: applying upstream-workaround-int128-arch-32bits.patch dpkg-source: info: applying upstream-fix-autotools-update.patch dpkg-source: info: applying upstream-sanitise-autotools-git_data-discard.patch dpkg-source: info: applying debianization-documentation.patch dpkg-source: info: applying debianization-documentation-adhoc.patch I: Not using root during the build. I: Installing the build-deps I: user script /srv/workspace/pbuilder/750065/tmp/hooks/D02_print_environment starting I: set BUILDDIR='/build/reproducible-path' BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' BUILDUSERNAME='pbuilder1' BUILD_ARCH='amd64' DEBIAN_FRONTEND='noninteractive' DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=12 ' DISTRIBUTION='unstable' HOME='/root' HOST_ARCH='amd64' IFS=' ' INVOCATION_ID='f239a73c3f8d4f6394163e24c5c5a316' LANG='C' LANGUAGE='en_US:en' LC_ALL='C' MAIL='/var/mail/root' OPTIND='1' PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' PBCURRENTCOMMANDLINEOPERATION='build' PBUILDER_OPERATION='build' PBUILDER_PKGDATADIR='/usr/share/pbuilder' PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' PBUILDER_SYSCONFDIR='/etc' PPID='750065' PS1='# ' PS2='> ' PS4='+ ' PWD='/' SHELL='/bin/bash' SHLVL='2' SUDO_COMMAND='/usr/bin/timeout -k 18.1h 18h /usr/bin/ionice -c 3 /usr/bin/nice /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.ULgpyCNo/pbuilderrc_Oogj --distribution unstable --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.ULgpyCNo/b1 --logfile b1/build.log graph-tool_2.77+ds-3.dsc' SUDO_GID='109' SUDO_UID='104' SUDO_USER='jenkins' TERM='unknown' TZ='/usr/share/zoneinfo/Etc/GMT+12' USER='root' _='/usr/bin/systemd-run' I: uname -a Linux infom02-amd64 6.11.10+bpo-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.11.10-1~bpo12+1 (2024-12-19) x86_64 GNU/Linux I: ls -l /bin lrwxrwxrwx 1 root root 7 Nov 22 2024 /bin -> usr/bin I: user script /srv/workspace/pbuilder/750065/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy Version: 0.invalid.0 Architecture: amd64 Maintainer: Debian Pbuilder Team Description: Dummy package to satisfy dependencies with aptitude - created by pbuilder This package was created automatically by pbuilder to satisfy the build-dependencies of the package being currently built. Depends: debhelper-compat (= 13), autoconf-archive, dh-python, python3, libgmp-dev, libcgal-dev, libboost-thread-dev, libboost-system-dev, libboost-iostreams-dev, libboost-regex-dev, libboost-coroutine-dev, libboost-graph-dev, libboost-python-dev, libexpat1-dev, libsparsehash-dev, libcairomm-1.0-dev, python3-dev, python3-numpy-dev, python3-cairo-dev, python3-numpy, python3-scipy, python3-matplotlib, zstd, vpx-tools, librsvg2-common, gir1.2-gtk-3.0, python3-gi, dh-sequence-sphinxdoc, python3-docutils, python3-sphinx, python3-doc, python3-numpydoc, python-scipy-doc, python-mpltoolkits.basemap-doc, python3-cairo-doc, python-ipython-doc, python-pandas-doc, texlive-latex-base, texlive-latex-recommended, texlive-fonts-recommended, texlive-latex-extra, cm-super-minimal, poppler-utils, latexmk dpkg-deb: building package 'pbuilder-satisfydepends-dummy' in '/tmp/satisfydepends-aptitude/pbuilder-satisfydepends-dummy.deb'. Selecting previously unselected package pbuilder-satisfydepends-dummy. (Reading database ... 19831 files and directories currently installed.) Preparing to unpack .../pbuilder-satisfydepends-dummy.deb ... Unpacking pbuilder-satisfydepends-dummy (0.invalid.0) ... dpkg: pbuilder-satisfydepends-dummy: dependency problems, but configuring anyway as you requested: pbuilder-satisfydepends-dummy depends on debhelper-compat (= 13); however: Package debhelper-compat is not installed. pbuilder-satisfydepends-dummy depends on autoconf-archive; however: Package autoconf-archive is not installed. pbuilder-satisfydepends-dummy depends on dh-python; however: Package dh-python is not installed. pbuilder-satisfydepends-dummy depends on python3; however: Package python3 is not installed. pbuilder-satisfydepends-dummy depends on libgmp-dev; however: Package libgmp-dev is not installed. pbuilder-satisfydepends-dummy depends on libcgal-dev; however: Package libcgal-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-thread-dev; however: Package libboost-thread-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-system-dev; however: Package libboost-system-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-iostreams-dev; however: Package libboost-iostreams-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-regex-dev; however: Package libboost-regex-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-coroutine-dev; however: Package libboost-coroutine-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-graph-dev; however: Package libboost-graph-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-python-dev; however: Package libboost-python-dev is not installed. pbuilder-satisfydepends-dummy depends on libexpat1-dev; however: Package libexpat1-dev is not installed. pbuilder-satisfydepends-dummy depends on libsparsehash-dev; however: Package libsparsehash-dev is not installed. pbuilder-satisfydepends-dummy depends on libcairomm-1.0-dev; however: Package libcairomm-1.0-dev is not installed. pbuilder-satisfydepends-dummy depends on python3-dev; however: Package python3-dev is not installed. pbuilder-satisfydepends-dummy depends on python3-numpy-dev; however: Package python3-numpy-dev is not installed. pbuilder-satisfydepends-dummy depends on python3-cairo-dev; however: Package python3-cairo-dev is not installed. pbuilder-satisfydepends-dummy depends on python3-numpy; however: Package python3-numpy is not installed. pbuilder-satisfydepends-dummy depends on python3-scipy; however: Package python3-scipy is not installed. pbuilder-satisfydepends-dummy depends on python3-matplotlib; however: Package python3-matplotlib is not installed. pbuilder-satisfydepends-dummy depends on zstd; however: Package zstd is not installed. pbuilder-satisfydepends-dummy depends on vpx-tools; however: Package vpx-tools is not installed. pbuilder-satisfydepends-dummy depends on librsvg2-common; however: Package librsvg2-common is not installed. pbuilder-satisfydepends-dummy depends on gir1.2-gtk-3.0; however: Package gir1.2-gtk-3.0 is not installed. pbuilder-satisfydepends-dummy depends on python3-gi; however: Package python3-gi is not installed. pbuilder-satisfydepends-dummy depends on dh-sequence-sphinxdoc; however: Package dh-sequence-sphinxdoc is not installed. pbuilder-satisfydepends-dummy depends on python3-docutils; however: Package python3-docutils is not installed. pbuilder-satisfydepends-dummy depends on python3-sphinx; however: Package python3-sphinx is not installed. pbuilder-satisfydepends-dummy depends on python3-doc; however: Package python3-doc is not installed. pbuilder-satisfydepends-dummy depends on python3-numpydoc; however: Package python3-numpydoc is not installed. pbuilder-satisfydepends-dummy depends on python-scipy-doc; however: Package python-scipy-doc is not installed. pbuilder-satisfydepends-dummy depends on python-mpltoolkits.basemap-doc; however: Package python-mpltoolkits.basemap-doc is not installed. pbuilder-satisfydepends-dummy depends on python3-cairo-doc; however: Package python3-cairo-doc is not installed. pbuilder-satisfydepends-dummy depends on python-ipython-doc; however: Package python-ipython-doc is not installed. pbuilder-satisfydepends-dummy depends on python-pandas-doc; however: Package python-pandas-doc is not installed. pbuilder-satisfydepends-dummy depends on texlive-latex-base; however: Package texlive-latex-base is not installed. pbuilder-satisfydepends-dummy depends on texlive-latex-recommended; however: Package texlive-latex-recommended is not installed. pbuilder-satisfydepends-dummy depends on texlive-fonts-recommended; however: Package texlive-fonts-recommended is not installed. pbuilder-satisfydepends-dummy depends on texlive-latex-extra; however: Package texlive-latex-extra is not installed. pbuilder-satisfydepends-dummy depends on cm-super-minimal; however: Package cm-super-minimal is not installed. pbuilder-satisfydepends-dummy depends on poppler-utils; however: Package poppler-utils is not installed. pbuilder-satisfydepends-dummy depends on latexmk; however: Package latexmk is not installed. Setting up pbuilder-satisfydepends-dummy (0.invalid.0) ... Reading package lists... Building dependency tree... Reading state information... Initializing package states... Writing extended state information... Building tag database... pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) The following NEW packages will be installed: adwaita-icon-theme{a} at-spi2-common{a} autoconf{a} autoconf-archive{a} automake{a} autopoint{a} autotools-dev{a} blt{a} bsdextrautils{a} ca-certificates{a} cm-super-minimal{a} dbus{a} dbus-bin{a} dbus-daemon{a} dbus-session-bus-common{a} dbus-system-bus-common{a} dbus-user-session{a} dconf-gsettings-backend{a} dconf-service{a} debhelper{a} dh-autoreconf{a} dh-python{a} dh-strip-nondeterminism{a} dirmngr{a} docutils-common{a} dwz{a} file{a} fontconfig{a} fontconfig-config{a} fonts-dejavu-core{a} fonts-dejavu-mono{a} fonts-font-awesome{a} fonts-lato{a} fonts-lmodern{a} fonts-lyx{a} fonts-mathjax{a} fonts-open-sans{a} gettext{a} gettext-base{a} gir1.2-atk-1.0{a} gir1.2-freedesktop{a} gir1.2-gdkpixbuf-2.0{a} gir1.2-girepository-2.0{a} gir1.2-glib-2.0{a} gir1.2-gtk-3.0{a} gir1.2-harfbuzz-0.0{a} gir1.2-pango-1.0{a} girepository-tools{a} gnupg{a} gnupg-l10n{a} gpg{a} gpg-agent{a} gpgconf{a} gpgsm{a} groff-base{a} gtk-update-icon-cache{a} hicolor-icon-theme{a} icu-devtools{a} intltool-debian{a} latexmk{a} libapache-pom-java{a} libapparmor1{a} libarchive-zip-perl{a} libassuan9{a} libatk-bridge2.0-0t64{a} libatk1.0-0t64{a} libatspi2.0-0t64{a} libavahi-client3{a} libavahi-common-data{a} libavahi-common3{a} libblas3{a} libblkid-dev{a} libboost-atomic1.83-dev{a} libboost-atomic1.83.0{a} libboost-chrono1.83-dev{a} libboost-chrono1.83.0t64{a} libboost-context1.83-dev{a} libboost-context1.83.0{a} libboost-coroutine-dev{a} libboost-coroutine1.83-dev{a} libboost-coroutine1.83.0{a} libboost-date-time1.83-dev{a} libboost-date-time1.83.0{a} libboost-dev{a} libboost-graph-dev{a} libboost-graph1.83-dev{a} libboost-graph1.83.0{a} libboost-iostreams-dev{a} libboost-iostreams1.83-dev{a} libboost-program-options-dev{a} libboost-program-options1.83-dev{a} libboost-program-options1.83.0{a} libboost-python-dev{a} libboost-python1.83-dev{a} libboost-python1.83.0{a} libboost-regex-dev{a} libboost-regex1.83-dev{a} libboost-regex1.83.0{a} libboost-serialization1.83-dev{a} libboost-serialization1.83.0{a} libboost-system-dev{a} libboost-system1.83-dev{a} libboost-system1.83.0{a} libboost-test1.83-dev{a} libboost-test1.83.0{a} libboost-thread-dev{a} libboost-thread1.83-dev{a} libboost-thread1.83.0{a} libboost1.83-dev{a} libbrotli-dev{a} libbrotli1{a} libbz2-dev{a} libcairo-gobject2{a} libcairo-script-interpreter2{a} libcairo2{a} libcairo2-dev{a} libcairomm-1.0-1v5{a} libcairomm-1.0-dev{a} libcgal-dev{a} libcloudproviders0{a} libcolord2{a} libcom-err2{a} libcommons-logging-java{a} libcommons-parent-java{a} libcups2t64{a} libcurl3t64-gnutls{a} libdatrie1{a} libdav1d7{a} libdbus-1-3{a} libdconf1{a} libdebhelper-perl{a} libdeflate0{a} libelf1t64{a} libepoxy0{a} libexpat1{a} libexpat1-dev{a} libffi-dev{a} libffi8{a} libfile-stripnondeterminism-perl{a} libfontbox-java{a} libfontconfig-dev{a} libfontconfig1{a} libfreetype-dev{a} libfreetype6{a} libfribidi0{a} libgcrypt20{a} libgdk-pixbuf-2.0-0{a} libgdk-pixbuf2.0-common{a} libgfortran5{a} libgio-2.0-dev{a} libgio-2.0-dev-bin{a} libgirepository-1.0-1{a} libgirepository-2.0-0{a} libglib2.0-0t64{a} libglib2.0-bin{a} libglib2.0-data{a} libglib2.0-dev{a} libglib2.0-dev-bin{a} libgmp-dev{a} libgmpxx4ldbl{a} libgnutls30t64{a} libgpg-error0{a} libgpgme11t64{a} libgpgmepp6t64{a} libgraphite2-3{a} libgssapi-krb5-2{a} libgtk-3-0t64{a} libgtk-3-common{a} libharfbuzz-gobject0{a} libharfbuzz0b{a} libice-dev{a} libice6{a} libicu-dev{a} libicu72{a} libidn2-0{a} libimagequant0{a} libjbig0{a} libjpeg62-turbo{a} libjs-jquery{a} libjs-jquery-ui{a} libjs-mathjax{a} libjs-sphinxdoc{a} libjs-underscore{a} libjson-perl{a} libk5crypto3{a} libkeyutils1{a} libkpathsea6{a} libkrb5-3{a} libkrb5support0{a} libksba8{a} liblapack3{a} liblbfgsb0{a} liblcms2-2{a} libldap2{a} liblerc4{a} liblzo2-2{a} libmagic-mgc{a} libmagic1t64{a} libmount-dev{a} libmpfi0{a} libmpfr-dev{a} libnghttp2-14{a} libnghttp3-9{a} libngtcp2-16{a} libngtcp2-crypto-gnutls8{a} libnpth0t64{a} libnspr4{a} libnss3{a} libopenjp2-7{a} libp11-kit0{a} libpam-systemd{a} libpango-1.0-0{a} libpangocairo-1.0-0{a} libpangoft2-1.0-0{a} libpangoxft-1.0-0{a} libpaper-utils{a} libpaper2{a} libpcre2-16-0{a} libpcre2-32-0{a} libpcre2-dev{a} libpcre2-posix3{a} libpdfbox-java{a} libpipeline1{a} libpixman-1-0{a} libpixman-1-dev{a} libpkgconf3{a} libpng-dev{a} libpng16-16t64{a} libpoppler140{a} libpotrace0{a} libproc2-0{a} libpsl5t64{a} libptexenc1{a} libpython3-dev{a} libpython3-stdlib{a} libpython3.13{a} libpython3.13-dev{a} libpython3.13-minimal{a} libpython3.13-stdlib{a} libqhull-r8.0{a} libraqm0{a} libreadline8t64{a} librsvg2-2{a} librsvg2-common{a} librtmp1{a} libsasl2-2{a} libsasl2-modules-db{a} libselinux1-dev{a} libsepol-dev{a} libsharpyuv0{a} libsigc++-2.0-dev{a} libsm-dev{a} libsm6{a} libsparsehash-dev{a} libssh2-1t64{a} libsynctex2{a} libsysprof-capture-4-dev{a} libsystemd-shared{a} libtasn1-6{a} libtcl8.6{a} libteckit0{a} libtexlua53-5{a} libtext-charwidth-perl{a} libtext-wrapi18n-perl{a} libthai-data{a} libthai0{a} libtiff6{a} libtk8.6{a} libtool{a} libuchardet0{a} libunistring5{a} libvpx9{a} libwayland-client0{a} libwayland-cursor0{a} libwayland-egl1{a} libwebp7{a} libwebpdemux2{a} libwebpmux3{a} libx11-6{a} libx11-data{a} libx11-dev{a} libxau-dev{a} libxau6{a} libxaw7{a} libxcb-render0{a} libxcb-render0-dev{a} libxcb-shm0{a} libxcb-shm0-dev{a} libxcb1{a} libxcb1-dev{a} libxcomposite1{a} libxcursor1{a} libxdamage1{a} libxdmcp-dev{a} libxdmcp6{a} libxext-dev{a} libxext6{a} libxfixes3{a} libxft2{a} libxi6{a} libxinerama1{a} libxkbcommon0{a} libxml2{a} libxmu6{a} libxpm4{a} libxrandr2{a} libxrender-dev{a} libxrender1{a} libxslt1.1{a} libxss1{a} libxt6t64{a} libzzip-0-13t64{a} m4{a} man-db{a} media-types{a} native-architecture{a} netbase{a} openssl{a} pinentry-curses{a} pkgconf{a} pkgconf-bin{a} po-debconf{a} poppler-utils{a} preview-latex-style{a} procps{a} python-babel-localedata{a} python-ipython-doc{a} python-matplotlib-data{a} python-mpltoolkits.basemap-doc{a} python-pandas-doc{a} python-scipy-doc{a} python3{a} python3-alabaster{a} python3-attr{a} python3-autocommand{a} python3-babel{a} python3-brotli{a} python3-cairo{a} python3-cairo-dev{a} python3-cairo-doc{a} python3-certifi{a} python3-chardet{a} python3-charset-normalizer{a} python3-contourpy{a} python3-cycler{a} python3-dateutil{a} python3-decorator{a} python3-defusedxml{a} python3-dev{a} python3-doc{a} python3-docutils{a} python3-fonttools{a} python3-fs{a} python3-gi{a} python3-idna{a} python3-imagesize{a} python3-inflect{a} python3-jaraco.context{a} python3-jaraco.functools{a} python3-jaraco.text{a} python3-jinja2{a} python3-kiwisolver{a} python3-lxml{a} python3-lz4{a} python3-markupsafe{a} python3-matplotlib{a} python3-minimal{a} python3-more-itertools{a} python3-mpmath{a} python3-numpy{a} python3-numpydoc{a} python3-packaging{a} python3-pil{a} python3-pil.imagetk{a} python3-pkg-resources{a} python3-platformdirs{a} python3-pygments{a} python3-pyparsing{a} python3-requests{a} python3-roman{a} python3-scipy{a} python3-setuptools{a} python3-snowballstemmer{a} python3-sphinx{a} python3-sympy{a} python3-tabulate{a} python3-tk{a} python3-typeguard{a} python3-typing-extensions{a} python3-tz{a} python3-ufolib2{a} python3-unicodedata2{a} python3-urllib3{a} python3-zipp{a} python3.12-tk{a} python3.13{a} python3.13-dev{a} python3.13-doc{a} python3.13-minimal{a} python3.13-tk{a} readline-common{a} sensible-utils{a} sgml-base{a} shared-mime-info{a} sphinx-common{a} sphinx-rtd-theme-common{a} systemd{a} systemd-sysv{a} t1utils{a} tex-common{a} texlive-base{a} texlive-binaries{a} texlive-fonts-recommended{a} texlive-latex-base{a} texlive-latex-extra{a} texlive-latex-recommended{a} texlive-pictures{a} tk8.6-blt2.5{a} tzdata{a} ucf{a} unicode-data{a} uuid-dev{a} vpx-tools{a} x11-common{a} x11proto-core-dev{a} x11proto-dev{a} xdg-utils{a} xkb-data{a} xml-core{a} xorg-sgml-doctools{a} xtrans-dev{a} zlib1g-dev{a} zstd{a} The following packages are RECOMMENDED but will NOT be installed: apvlv at-spi2-core atril bzip2-doc chrony curl default-jre dvisvgm evince ghostscript gnupg-utils gpg-wks-client gpgv gpgv-from-sq gv isympy-common javascript-common krb5-locales libarchive-cpio-perl libfile-mimeinfo-perl libgdk-pixbuf2.0-bin libgpg-error-l10n libgtk-3-bin libjson-xs-perl libkmod2 libldap-common libltdl-dev libmail-sendmail-perl libnet-dbus-perl libnss-systemd libpng-tools libsasl2-modules libspreadsheet-parseexcel-perl libx11-protocol-perl linux-sysctl-defaults lmodern lynx mupdf ntpsec okular openntpd poppler-data psmisc publicsuffix python3-bs4 python3-cssselect python3-html5lib python3-olefile python3-pooch qpdfview qpdfview-ps-plugin ruby systemd-cryptsetup systemd-timesyncd tex-gyre texlive-plain-generic tipa tk viewpdf.app wget x11-utils x11-xserver-utils xdg-user-dirs xpdf zathura-pdf-poppler zathura-ps 0 packages upgraded, 433 newly installed, 0 to remove and 0 not upgraded. Need to get 407 MB of archives. After unpacking 1973 MB will be used. Writing extended state information... Get: 1 http://deb.debian.org/debian unstable/main amd64 libsystemd-shared amd64 257.2-2 [2138 kB] Get: 2 http://deb.debian.org/debian unstable/main amd64 libapparmor1 amd64 3.1.7-1+b3 [42.1 kB] Get: 3 http://deb.debian.org/debian unstable/main amd64 systemd amd64 257.2-2 [3092 kB] Get: 4 http://deb.debian.org/debian unstable/main amd64 systemd-sysv amd64 257.2-2 [60.8 kB] Get: 5 http://deb.debian.org/debian unstable/main amd64 libdbus-1-3 amd64 1.16.0-1 [177 kB] Get: 6 http://deb.debian.org/debian unstable/main amd64 dbus-bin amd64 1.16.0-1 [78.9 kB] Get: 7 http://deb.debian.org/debian unstable/main amd64 dbus-session-bus-common all 1.16.0-1 [51.1 kB] Get: 8 http://deb.debian.org/debian unstable/main amd64 libexpat1 amd64 2.6.4-1 [106 kB] Get: 9 http://deb.debian.org/debian unstable/main amd64 dbus-daemon amd64 1.16.0-1 [157 kB] Get: 10 http://deb.debian.org/debian unstable/main amd64 dbus-system-bus-common all 1.16.0-1 [52.2 kB] Get: 11 http://deb.debian.org/debian unstable/main amd64 dbus amd64 1.16.0-1 [70.5 kB] Get: 12 http://deb.debian.org/debian unstable/main amd64 autoconf-archive all 20220903-3 [775 kB] Get: 13 http://deb.debian.org/debian unstable/main amd64 fonts-lato all 2.015-1 [2780 kB] Get: 14 http://deb.debian.org/debian unstable/main amd64 libpython3.13-minimal amd64 3.13.1-3 [858 kB] Get: 15 http://deb.debian.org/debian unstable/main amd64 python3.13-minimal amd64 3.13.1-3 [2202 kB] Get: 16 http://deb.debian.org/debian unstable/main amd64 python3-minimal amd64 3.13.1-2 [27.0 kB] Get: 17 http://deb.debian.org/debian unstable/main amd64 media-types all 10.1.0 [26.9 kB] Get: 18 http://deb.debian.org/debian unstable/main amd64 netbase all 6.4 [12.8 kB] Get: 19 http://deb.debian.org/debian unstable/main amd64 tzdata all 2025a-1 [259 kB] Get: 20 http://deb.debian.org/debian unstable/main amd64 libffi8 amd64 3.4.6-1 [23.6 kB] Get: 21 http://deb.debian.org/debian unstable/main amd64 readline-common all 8.2-6 [69.4 kB] Get: 22 http://deb.debian.org/debian unstable/main amd64 libreadline8t64 amd64 8.2-6 [169 kB] Get: 23 http://deb.debian.org/debian unstable/main amd64 libpython3.13-stdlib amd64 3.13.1-3 [1973 kB] Get: 24 http://deb.debian.org/debian unstable/main amd64 python3.13 amd64 3.13.1-3 [740 kB] Get: 25 http://deb.debian.org/debian unstable/main amd64 libpython3-stdlib amd64 3.13.1-2 [9952 B] Get: 26 http://deb.debian.org/debian unstable/main amd64 python3 amd64 3.13.1-2 [28.0 kB] Get: 27 http://deb.debian.org/debian unstable/main amd64 sgml-base all 1.31 [15.4 kB] Get: 28 http://deb.debian.org/debian unstable/main amd64 libproc2-0 amd64 2:4.0.4-6 [64.8 kB] Get: 29 http://deb.debian.org/debian unstable/main amd64 procps amd64 2:4.0.4-6 [879 kB] Get: 30 http://deb.debian.org/debian unstable/main amd64 sensible-utils all 0.0.24 [24.8 kB] Get: 31 http://deb.debian.org/debian unstable/main amd64 openssl amd64 3.4.0-2 [1422 kB] Get: 32 http://deb.debian.org/debian unstable/main amd64 ca-certificates all 20241223 [164 kB] Get: 33 http://deb.debian.org/debian unstable/main amd64 libmagic-mgc amd64 1:5.45-3+b1 [314 kB] Get: 34 http://deb.debian.org/debian unstable/main amd64 libmagic1t64 amd64 1:5.45-3+b1 [108 kB] Get: 35 http://deb.debian.org/debian unstable/main amd64 file amd64 1:5.45-3+b1 [43.3 kB] Get: 36 http://deb.debian.org/debian unstable/main amd64 gettext-base amd64 0.23.1-1 [243 kB] Get: 37 http://deb.debian.org/debian unstable/main amd64 libuchardet0 amd64 0.0.8-1+b2 [68.9 kB] Get: 38 http://deb.debian.org/debian unstable/main amd64 groff-base amd64 1.23.0-7 [1185 kB] Get: 39 http://deb.debian.org/debian unstable/main amd64 libpam-systemd amd64 257.2-2 [293 kB] Get: 40 http://deb.debian.org/debian unstable/main amd64 bsdextrautils amd64 2.40.4-1 [92.2 kB] Get: 41 http://deb.debian.org/debian unstable/main amd64 libpipeline1 amd64 1.5.8-1 [42.0 kB] Get: 42 http://deb.debian.org/debian unstable/main amd64 man-db amd64 2.13.0-1 [1420 kB] Get: 43 http://deb.debian.org/debian unstable/main amd64 libtext-charwidth-perl amd64 0.04-11+b4 [9476 B] Get: 44 http://deb.debian.org/debian unstable/main amd64 libtext-wrapi18n-perl all 0.06-10 [8808 B] Get: 45 http://deb.debian.org/debian unstable/main amd64 ucf all 3.0048 [42.0 kB] Get: 46 http://deb.debian.org/debian unstable/main amd64 libgdk-pixbuf2.0-common all 2.42.12+dfsg-2 [311 kB] Get: 47 http://deb.debian.org/debian unstable/main amd64 libglib2.0-0t64 amd64 2.82.4-2 [1502 kB] Get: 48 http://deb.debian.org/debian unstable/main amd64 libicu72 amd64 72.1-6 [9421 kB] Get: 49 http://deb.debian.org/debian unstable/main amd64 libxml2 amd64 2.12.7+dfsg+really2.9.14-0.2+b1 [699 kB] Get: 50 http://deb.debian.org/debian unstable/main amd64 shared-mime-info amd64 2.4-5+b1 [759 kB] Get: 51 http://deb.debian.org/debian unstable/main amd64 libjpeg62-turbo amd64 1:2.1.5-3+b1 [168 kB] Get: 52 http://deb.debian.org/debian unstable/main amd64 libpng16-16t64 amd64 1.6.45-1 [281 kB] Get: 53 http://deb.debian.org/debian unstable/main amd64 libdeflate0 amd64 1.23-1+b1 [47.5 kB] Get: 54 http://deb.debian.org/debian unstable/main amd64 libjbig0 amd64 2.1-6.1+b2 [32.1 kB] Get: 55 http://deb.debian.org/debian unstable/main amd64 liblerc4 amd64 4.0.0+ds-5 [183 kB] Get: 56 http://deb.debian.org/debian unstable/main amd64 libsharpyuv0 amd64 1.5.0-0.1 [116 kB] Get: 57 http://deb.debian.org/debian unstable/main amd64 libwebp7 amd64 1.5.0-0.1 [318 kB] Get: 58 http://deb.debian.org/debian unstable/main amd64 libtiff6 amd64 4.5.1+git230720-5 [324 kB] Get: 59 http://deb.debian.org/debian unstable/main amd64 libgdk-pixbuf-2.0-0 amd64 2.42.12+dfsg-2 [140 kB] Get: 60 http://deb.debian.org/debian unstable/main amd64 gtk-update-icon-cache amd64 4.16.12+ds-1 [50.6 kB] Get: 61 http://deb.debian.org/debian unstable/main amd64 hicolor-icon-theme all 0.18-2 [11.8 kB] Get: 62 http://deb.debian.org/debian unstable/main amd64 adwaita-icon-theme all 47.0-2 [463 kB] Get: 63 http://deb.debian.org/debian unstable/main amd64 at-spi2-common all 2.55.0.1-1 [170 kB] Get: 64 http://deb.debian.org/debian unstable/main amd64 m4 amd64 1.4.19-5 [294 kB] Get: 65 http://deb.debian.org/debian unstable/main amd64 autoconf all 2.72-3 [493 kB] Get: 66 http://deb.debian.org/debian unstable/main amd64 autotools-dev all 20220109.1 [51.6 kB] Get: 67 http://deb.debian.org/debian unstable/main amd64 automake all 1:1.16.5-1.3 [823 kB] Get: 68 http://deb.debian.org/debian unstable/main amd64 autopoint all 0.23.1-1 [770 kB] Get: 69 http://deb.debian.org/debian unstable/main amd64 libtcl8.6 amd64 8.6.16+dfsg-1 [1042 kB] Get: 70 http://deb.debian.org/debian unstable/main amd64 libbrotli1 amd64 1.1.0-2+b6 [302 kB] Get: 71 http://deb.debian.org/debian unstable/main amd64 libfreetype6 amd64 2.13.3+dfsg-1 [452 kB] Get: 72 http://deb.debian.org/debian unstable/main amd64 fonts-dejavu-mono all 2.37-8 [489 kB] Get: 73 http://deb.debian.org/debian unstable/main amd64 fonts-dejavu-core all 2.37-8 [840 kB] Get: 74 http://deb.debian.org/debian unstable/main amd64 fontconfig-config amd64 2.15.0-2 [317 kB] Get: 75 http://deb.debian.org/debian unstable/main amd64 libfontconfig1 amd64 2.15.0-2 [391 kB] Get: 76 http://deb.debian.org/debian unstable/main amd64 libxau6 amd64 1:1.0.11-1 [20.4 kB] Get: 77 http://deb.debian.org/debian unstable/main amd64 libxdmcp6 amd64 1:1.1.5-1 [27.8 kB] Get: 78 http://deb.debian.org/debian unstable/main amd64 libxcb1 amd64 1.17.0-2+b1 [144 kB] Get: 79 http://deb.debian.org/debian unstable/main amd64 libx11-data all 2:1.8.10-2 [337 kB] Get: 80 http://deb.debian.org/debian unstable/main amd64 libx11-6 amd64 2:1.8.10-2 [813 kB] Get: 81 http://deb.debian.org/debian unstable/main amd64 libxrender1 amd64 1:0.9.10-1.1+b3 [27.8 kB] Get: 82 http://deb.debian.org/debian unstable/main amd64 libxft2 amd64 2.3.6-1+b3 [54.6 kB] Get: 83 http://deb.debian.org/debian unstable/main amd64 libxext6 amd64 2:1.3.4-1+b3 [50.4 kB] Get: 84 http://deb.debian.org/debian unstable/main amd64 x11-common all 1:7.7+23.2 [216 kB] Get: 85 http://deb.debian.org/debian unstable/main amd64 libxss1 amd64 1:1.2.3-1+b3 [17.0 kB] Get: 86 http://deb.debian.org/debian unstable/main amd64 libtk8.6 amd64 8.6.16-1 [793 kB] Get: 87 http://deb.debian.org/debian unstable/main amd64 tk8.6-blt2.5 amd64 2.5.3+dfsg-7 [586 kB] Get: 88 http://deb.debian.org/debian unstable/main amd64 blt amd64 2.5.3+dfsg-7 [6024 B] Get: 89 http://deb.debian.org/debian unstable/main amd64 tex-common all 6.18 [32.5 kB] Get: 90 http://deb.debian.org/debian unstable/main amd64 libpaper2 amd64 2.2.5-0.3 [16.3 kB] Get: 91 http://deb.debian.org/debian unstable/main amd64 libpaper-utils amd64 2.2.5-0.3 [16.1 kB] Get: 92 http://deb.debian.org/debian unstable/main amd64 libkpathsea6 amd64 2024.20240313.70630+ds-5+b1 [157 kB] Get: 93 http://deb.debian.org/debian unstable/main amd64 libptexenc1 amd64 2024.20240313.70630+ds-5+b1 [49.4 kB] Get: 94 http://deb.debian.org/debian unstable/main amd64 libsynctex2 amd64 2024.20240313.70630+ds-5+b1 [63.0 kB] Get: 95 http://deb.debian.org/debian unstable/main amd64 libtexlua53-5 amd64 2024.20240313.70630+ds-5+b1 [115 kB] Get: 96 http://deb.debian.org/debian unstable/main amd64 t1utils amd64 1.41-4 [62.1 kB] Get: 97 http://deb.debian.org/debian unstable/main amd64 libpixman-1-0 amd64 0.44.0-3 [248 kB] Get: 98 http://deb.debian.org/debian unstable/main amd64 libxcb-render0 amd64 1.17.0-2+b1 [115 kB] Get: 99 http://deb.debian.org/debian unstable/main amd64 libxcb-shm0 amd64 1.17.0-2+b1 [105 kB] Get: 100 http://deb.debian.org/debian unstable/main amd64 libcairo2 amd64 1.18.2-2 [535 kB] Get: 101 http://deb.debian.org/debian unstable/main amd64 libgraphite2-3 amd64 1.3.14-2+b1 [75.4 kB] Get: 102 http://deb.debian.org/debian unstable/main amd64 libharfbuzz0b amd64 10.2.0-1 [479 kB] Get: 103 http://deb.debian.org/debian unstable/main amd64 libmpfi0 amd64 1.5.4+ds-4 [35.5 kB] Get: 104 http://deb.debian.org/debian unstable/main amd64 libpotrace0 amd64 1.16-2+b2 [25.6 kB] Get: 105 http://deb.debian.org/debian unstable/main amd64 libteckit0 amd64 2.5.12+ds1-1+b1 [341 kB] Get: 106 http://deb.debian.org/debian unstable/main amd64 libice6 amd64 2:1.1.1-1 [65.4 kB] Get: 107 http://deb.debian.org/debian unstable/main amd64 libsm6 amd64 2:1.2.4-1 [35.2 kB] Get: 108 http://deb.debian.org/debian unstable/main amd64 libxt6t64 amd64 1:1.2.1-1.2+b2 [188 kB] Get: 109 http://deb.debian.org/debian unstable/main amd64 libxmu6 amd64 2:1.1.3-3+b4 [59.0 kB] Get: 110 http://deb.debian.org/debian unstable/main amd64 libxpm4 amd64 1:3.5.17-1+b3 [56.2 kB] Get: 111 http://deb.debian.org/debian unstable/main amd64 libxaw7 amd64 2:1.0.16-1 [212 kB] Get: 112 http://deb.debian.org/debian unstable/main amd64 libxi6 amd64 2:1.8.2-1 [78.9 kB] Get: 113 http://deb.debian.org/debian unstable/main amd64 libzzip-0-13t64 amd64 0.13.72+dfsg.1-1.3 [56.2 kB] Get: 114 http://deb.debian.org/debian unstable/main amd64 texlive-binaries amd64 2024.20240313.70630+ds-5+b1 [8504 kB] Get: 115 http://deb.debian.org/debian unstable/main amd64 xdg-utils all 1.2.1-2 [75.8 kB] Get: 116 http://deb.debian.org/debian unstable/main amd64 texlive-base all 2024.20250114-1 [22.8 MB] Get: 117 http://deb.debian.org/debian unstable/main amd64 fonts-lmodern all 2.005-1 [4540 kB] Get: 118 http://deb.debian.org/debian unstable/main amd64 texlive-latex-base all 2024.20250114-1 [1282 kB] Get: 119 http://deb.debian.org/debian unstable/main amd64 texlive-latex-recommended all 2024.20250114-1 [8760 kB] Get: 120 http://deb.debian.org/debian unstable/main amd64 cm-super-minimal all 0.3.4-17 [5815 kB] Get: 121 http://deb.debian.org/debian unstable/main amd64 dbus-user-session amd64 1.16.0-1 [51.0 kB] Get: 122 http://deb.debian.org/debian unstable/main amd64 libdconf1 amd64 0.40.0-5 [41.8 kB] Get: 123 http://deb.debian.org/debian unstable/main amd64 dconf-service amd64 0.40.0-5 [32.4 kB] Get: 124 http://deb.debian.org/debian unstable/main amd64 dconf-gsettings-backend amd64 0.40.0-5 [28.6 kB] Get: 125 http://deb.debian.org/debian unstable/main amd64 libdebhelper-perl all 13.24.1 [90.9 kB] Get: 126 http://deb.debian.org/debian unstable/main amd64 libtool all 2.5.4-2 [539 kB] Get: 127 http://deb.debian.org/debian unstable/main amd64 dh-autoreconf all 20 [17.1 kB] Get: 128 http://deb.debian.org/debian unstable/main amd64 libarchive-zip-perl all 1.68-1 [104 kB] Get: 129 http://deb.debian.org/debian unstable/main amd64 libfile-stripnondeterminism-perl all 1.14.1-1 [19.6 kB] Get: 130 http://deb.debian.org/debian unstable/main amd64 dh-strip-nondeterminism all 1.14.1-1 [8584 B] Get: 131 http://deb.debian.org/debian unstable/main amd64 libelf1t64 amd64 0.192-4 [189 kB] Get: 132 http://deb.debian.org/debian unstable/main amd64 dwz amd64 0.15-1+b1 [110 kB] Get: 133 http://deb.debian.org/debian unstable/main amd64 libunistring5 amd64 1.3-1 [476 kB] Get: 134 http://deb.debian.org/debian unstable/main amd64 gettext amd64 0.23.1-1 [1680 kB] Get: 135 http://deb.debian.org/debian unstable/main amd64 intltool-debian all 0.35.0+20060710.6 [22.9 kB] Get: 136 http://deb.debian.org/debian unstable/main amd64 po-debconf all 1.0.21+nmu1 [248 kB] Get: 137 http://deb.debian.org/debian unstable/main amd64 debhelper all 13.24.1 [920 kB] Get: 138 http://deb.debian.org/debian unstable/main amd64 python3-autocommand all 2.2.2-3 [13.6 kB] Get: 139 http://deb.debian.org/debian unstable/main amd64 python3-more-itertools all 10.6.0-1 [65.3 kB] Get: 140 http://deb.debian.org/debian unstable/main amd64 python3-typing-extensions all 4.12.2-2 [73.0 kB] Get: 141 http://deb.debian.org/debian unstable/main amd64 python3-typeguard all 4.4.1-1 [37.0 kB] Get: 142 http://deb.debian.org/debian unstable/main amd64 python3-inflect all 7.3.1-2 [32.4 kB] Get: 143 http://deb.debian.org/debian unstable/main amd64 python3-jaraco.context all 6.0.0-1 [7984 B] Get: 144 http://deb.debian.org/debian unstable/main amd64 python3-jaraco.functools all 4.1.0-1 [12.0 kB] Get: 145 http://deb.debian.org/debian unstable/main amd64 python3-pkg-resources all 75.6.0-1 [222 kB] Get: 146 http://deb.debian.org/debian unstable/main amd64 python3-jaraco.text all 4.0.0-1 [11.4 kB] Get: 147 http://deb.debian.org/debian unstable/main amd64 python3-zipp all 3.21.0-1 [10.6 kB] Get: 148 http://deb.debian.org/debian unstable/main amd64 python3-setuptools all 75.6.0-1 [720 kB] Get: 149 http://deb.debian.org/debian unstable/main amd64 dh-python all 6.20250108 [113 kB] Get: 150 http://deb.debian.org/debian unstable/main amd64 libgpg-error0 amd64 1.51-3 [82.2 kB] Get: 151 http://deb.debian.org/debian unstable/main amd64 libassuan9 amd64 3.0.1-2 [60.6 kB] Get: 152 http://deb.debian.org/debian unstable/main amd64 libgcrypt20 amd64 1.11.0-7 [843 kB] Get: 153 http://deb.debian.org/debian unstable/main amd64 gpgconf amd64 2.2.46-1+b1 [121 kB] Get: 154 http://deb.debian.org/debian unstable/main amd64 libidn2-0 amd64 2.3.7-2+b1 [129 kB] Get: 155 http://deb.debian.org/debian unstable/main amd64 libp11-kit0 amd64 0.25.5-3 [425 kB] Get: 156 http://deb.debian.org/debian unstable/main amd64 libtasn1-6 amd64 4.19.0-3+b3 [49.5 kB] Get: 157 http://deb.debian.org/debian unstable/main amd64 libgnutls30t64 amd64 3.8.8-2 [1454 kB] Get: 158 http://deb.debian.org/debian unstable/main amd64 libksba8 amd64 1.6.7-2+b1 [136 kB] Get: 159 http://deb.debian.org/debian unstable/main amd64 libsasl2-modules-db amd64 2.1.28+dfsg1-8+b1 [19.9 kB] Get: 160 http://deb.debian.org/debian unstable/main amd64 libsasl2-2 amd64 2.1.28+dfsg1-8+b1 [57.6 kB] Get: 161 http://deb.debian.org/debian unstable/main amd64 libldap2 amd64 2.6.9+dfsg-1 [192 kB] Get: 162 http://deb.debian.org/debian unstable/main amd64 libnpth0t64 amd64 1.8-2 [22.9 kB] Get: 163 http://deb.debian.org/debian unstable/main amd64 dirmngr amd64 2.2.46-1+b1 [369 kB] Get: 164 http://deb.debian.org/debian unstable/main amd64 xml-core all 0.19 [20.1 kB] Get: 165 http://deb.debian.org/debian unstable/main amd64 docutils-common all 0.21.2+dfsg-2 [128 kB] Get: 166 http://deb.debian.org/debian unstable/main amd64 fontconfig amd64 2.15.0-2 [463 kB] Get: 167 http://deb.debian.org/debian unstable/main amd64 fonts-font-awesome all 5.0.10+really4.7.0~dfsg-4.1 [517 kB] Get: 168 http://deb.debian.org/debian unstable/main amd64 fonts-lyx all 2.4.3-1 [190 kB] Get: 169 http://deb.debian.org/debian unstable/main amd64 fonts-mathjax all 2.7.9+dfsg-1 [2210 kB] Get: 170 http://deb.debian.org/debian unstable/main amd64 fonts-open-sans all 1.11-2 [574 kB] Get: 171 http://deb.debian.org/debian unstable/main amd64 gir1.2-glib-2.0 amd64 2.82.4-2 [194 kB] Get: 172 http://deb.debian.org/debian unstable/main amd64 libatk1.0-0t64 amd64 2.55.0.1-1 [51.5 kB] Get: 173 http://deb.debian.org/debian unstable/main amd64 gir1.2-atk-1.0 amd64 2.55.0.1-1 [25.6 kB] Get: 174 http://deb.debian.org/debian unstable/main amd64 libcairo-gobject2 amd64 1.18.2-2 [130 kB] Get: 175 http://deb.debian.org/debian unstable/main amd64 gir1.2-freedesktop amd64 1.82.0-4 [60.2 kB] Get: 176 http://deb.debian.org/debian unstable/main amd64 gir1.2-gdkpixbuf-2.0 amd64 2.42.12+dfsg-2 [14.2 kB] Get: 177 http://deb.debian.org/debian unstable/main amd64 libgirepository-1.0-1 amd64 1.82.0-4 [115 kB] Get: 178 http://deb.debian.org/debian unstable/main amd64 gir1.2-girepository-2.0 amd64 1.82.0-4 [39.4 kB] Get: 179 http://deb.debian.org/debian unstable/main amd64 libharfbuzz-gobject0 amd64 10.2.0-1 [32.8 kB] Get: 180 http://deb.debian.org/debian unstable/main amd64 gir1.2-harfbuzz-0.0 amd64 10.2.0-1 [42.1 kB] Get: 181 http://deb.debian.org/debian unstable/main amd64 libfribidi0 amd64 1.0.16-1 [26.5 kB] Get: 182 http://deb.debian.org/debian unstable/main amd64 libthai-data all 0.1.29-2 [168 kB] Get: 183 http://deb.debian.org/debian unstable/main amd64 libdatrie1 amd64 0.2.13-3+b1 [38.1 kB] Get: 184 http://deb.debian.org/debian unstable/main amd64 libthai0 amd64 0.1.29-2+b1 [49.4 kB] Get: 185 http://deb.debian.org/debian unstable/main amd64 libpango-1.0-0 amd64 1.56.1-1 [226 kB] Get: 186 http://deb.debian.org/debian unstable/main amd64 libpangoft2-1.0-0 amd64 1.56.1-1 [55.3 kB] Get: 187 http://deb.debian.org/debian unstable/main amd64 libpangocairo-1.0-0 amd64 1.56.1-1 [35.8 kB] Get: 188 http://deb.debian.org/debian unstable/main amd64 libpangoxft-1.0-0 amd64 1.56.1-1 [27.6 kB] Get: 189 http://deb.debian.org/debian unstable/main amd64 gir1.2-pango-1.0 amd64 1.56.1-1 [39.0 kB] Get: 190 http://deb.debian.org/debian unstable/main amd64 libatspi2.0-0t64 amd64 2.55.0.1-1 [77.0 kB] Get: 191 http://deb.debian.org/debian unstable/main amd64 libatk-bridge2.0-0t64 amd64 2.55.0.1-1 [68.1 kB] Get: 192 http://deb.debian.org/debian unstable/main amd64 libcloudproviders0 amd64 0.3.6-1+b1 [29.2 kB] Get: 193 http://deb.debian.org/debian unstable/main amd64 liblcms2-2 amd64 2.16-2 [160 kB] Get: 194 http://deb.debian.org/debian unstable/main amd64 libcolord2 amd64 1.4.7-1+b2 [140 kB] Get: 195 http://deb.debian.org/debian unstable/main amd64 libavahi-common-data amd64 0.8-16 [112 kB] Get: 196 http://deb.debian.org/debian unstable/main amd64 libavahi-common3 amd64 0.8-16 [44.2 kB] Get: 197 http://deb.debian.org/debian unstable/main amd64 libavahi-client3 amd64 0.8-16 [48.4 kB] Get: 198 http://deb.debian.org/debian unstable/main amd64 libkrb5support0 amd64 1.21.3-4 [32.8 kB] Get: 199 http://deb.debian.org/debian unstable/main amd64 libcom-err2 amd64 1.47.2-1 [24.0 kB] Get: 200 http://deb.debian.org/debian unstable/main amd64 libk5crypto3 amd64 1.21.3-4 [80.9 kB] Get: 201 http://deb.debian.org/debian unstable/main amd64 libkeyutils1 amd64 1.6.3-4 [9092 B] Get: 202 http://deb.debian.org/debian unstable/main amd64 libkrb5-3 amd64 1.21.3-4 [326 kB] Get: 203 http://deb.debian.org/debian unstable/main amd64 libgssapi-krb5-2 amd64 1.21.3-4 [138 kB] Get: 204 http://deb.debian.org/debian unstable/main amd64 libcups2t64 amd64 2.4.10-2+b1 [251 kB] Get: 205 http://deb.debian.org/debian unstable/main amd64 libepoxy0 amd64 1.5.10-2 [193 kB] Get: 206 http://deb.debian.org/debian unstable/main amd64 libwayland-client0 amd64 1.23.0-1+b1 [26.6 kB] Get: 207 http://deb.debian.org/debian unstable/main amd64 libwayland-cursor0 amd64 1.23.0-1+b1 [11.7 kB] Get: 208 http://deb.debian.org/debian unstable/main amd64 libwayland-egl1 amd64 1.23.0-1+b1 [5664 B] Get: 209 http://deb.debian.org/debian unstable/main amd64 libxcomposite1 amd64 1:0.4.6-1 [16.3 kB] Get: 210 http://deb.debian.org/debian unstable/main amd64 libxfixes3 amd64 1:6.0.0-2+b3 [20.2 kB] Get: 211 http://deb.debian.org/debian unstable/main amd64 libxcursor1 amd64 1:1.2.3-1 [39.7 kB] Get: 212 http://deb.debian.org/debian unstable/main amd64 libxdamage1 amd64 1:1.1.6-1+b2 [15.5 kB] Get: 213 http://deb.debian.org/debian unstable/main amd64 libxinerama1 amd64 2:1.1.4-3+b3 [16.0 kB] Get: 214 http://deb.debian.org/debian unstable/main amd64 xkb-data all 2.42-1 [790 kB] Get: 215 http://deb.debian.org/debian unstable/main amd64 libxkbcommon0 amd64 1.7.0-2 [113 kB] Get: 216 http://deb.debian.org/debian unstable/main amd64 libxrandr2 amd64 2:1.5.4-1+b2 [36.4 kB] Get: 217 http://deb.debian.org/debian unstable/main amd64 libgtk-3-common all 3.24.43-5 [4655 kB] Get: 218 http://deb.debian.org/debian unstable/main amd64 libgtk-3-0t64 amd64 3.24.43-5 [2755 kB] Get: 219 http://deb.debian.org/debian unstable/main amd64 gir1.2-gtk-3.0 amd64 3.24.43-5 [223 kB] Get: 220 http://deb.debian.org/debian unstable/main amd64 native-architecture all 0.2.3 [2108 B] Get: 221 http://deb.debian.org/debian unstable/main amd64 libgirepository-2.0-0 amd64 2.82.4-2 [139 kB] Get: 222 http://deb.debian.org/debian unstable/main amd64 girepository-tools amd64 2.82.4-2 [145 kB] Get: 223 http://deb.debian.org/debian unstable/main amd64 gnupg-l10n all 2.2.46-1 [702 kB] Get: 224 http://deb.debian.org/debian unstable/main amd64 gpg amd64 2.2.46-1+b1 [532 kB] Get: 225 http://deb.debian.org/debian unstable/main amd64 pinentry-curses amd64 1.3.1-2 [86.4 kB] Get: 226 http://deb.debian.org/debian unstable/main amd64 gpg-agent amd64 2.2.46-1+b1 [252 kB] Get: 227 http://deb.debian.org/debian unstable/main amd64 gpgsm amd64 2.2.46-1+b1 [255 kB] Get: 228 http://deb.debian.org/debian unstable/main amd64 gnupg all 2.2.46-1 [376 kB] Get: 229 http://deb.debian.org/debian unstable/main amd64 icu-devtools amd64 72.1-6 [210 kB] Get: 230 http://deb.debian.org/debian unstable/main amd64 latexmk all 1:4.86~ds-1 [507 kB] Get: 231 http://deb.debian.org/debian unstable/main amd64 libapache-pom-java all 33-2 [5852 B] Get: 232 http://deb.debian.org/debian unstable/main amd64 libblas3 amd64 3.12.0-4 [152 kB] Get: 233 http://deb.debian.org/debian unstable/main amd64 uuid-dev amd64 2.40.4-1 [47.5 kB] Get: 234 http://deb.debian.org/debian unstable/main amd64 libblkid-dev amd64 2.40.4-1 [205 kB] Get: 235 http://deb.debian.org/debian unstable/main amd64 libboost1.83-dev amd64 1.83.0-4 [10.6 MB] Get: 236 http://deb.debian.org/debian unstable/main amd64 libboost-atomic1.83.0 amd64 1.83.0-4 [234 kB] Get: 237 http://deb.debian.org/debian unstable/main amd64 libboost-atomic1.83-dev amd64 1.83.0-4 [235 kB] Get: 238 http://deb.debian.org/debian unstable/main amd64 libboost-chrono1.83.0t64 amd64 1.83.0-4 [240 kB] Get: 239 http://deb.debian.org/debian unstable/main amd64 libboost-chrono1.83-dev amd64 1.83.0-4 [245 kB] Get: 240 http://deb.debian.org/debian unstable/main amd64 libboost-date-time1.83.0 amd64 1.83.0-4 [230 kB] Get: 241 http://deb.debian.org/debian unstable/main amd64 libboost-serialization1.83.0 amd64 1.83.0-4 [333 kB] Get: 242 http://deb.debian.org/debian unstable/main amd64 libboost-serialization1.83-dev amd64 1.83.0-4 [373 kB] Get: 243 http://deb.debian.org/debian unstable/main amd64 libboost-date-time1.83-dev amd64 1.83.0-4 [239 kB] Get: 244 http://deb.debian.org/debian unstable/main amd64 libboost-system1.83.0 amd64 1.83.0-4 [230 kB] Get: 245 http://deb.debian.org/debian unstable/main amd64 libboost-system1.83-dev amd64 1.83.0-4 [231 kB] Get: 246 http://deb.debian.org/debian unstable/main amd64 libboost-thread1.83.0 amd64 1.83.0-4 [269 kB] Get: 247 http://deb.debian.org/debian unstable/main amd64 libboost-thread1.83-dev amd64 1.83.0-4 [276 kB] Get: 248 http://deb.debian.org/debian unstable/main amd64 libboost-context1.83.0 amd64 1.83.0-4 [231 kB] Get: 249 http://deb.debian.org/debian unstable/main amd64 libboost-context1.83-dev amd64 1.83.0-4 [233 kB] Get: 250 http://deb.debian.org/debian unstable/main amd64 libboost-coroutine1.83.0 amd64 1.83.0-4 [234 kB] Get: 251 http://deb.debian.org/debian unstable/main amd64 libboost-coroutine1.83-dev amd64 1.83.0-4 [236 kB] Get: 252 http://deb.debian.org/debian unstable/main amd64 libboost-coroutine-dev amd64 1.83.0.2+b2 [3868 B] Get: 253 http://deb.debian.org/debian unstable/main amd64 libboost-dev amd64 1.83.0.2+b2 [3836 B] Get: 254 http://deb.debian.org/debian unstable/main amd64 libboost-graph1.83.0 amd64 1.83.0-4 [359 kB] Get: 255 http://deb.debian.org/debian unstable/main amd64 libboost-regex1.83.0 amd64 1.83.0-4 [330 kB] Get: 256 http://deb.debian.org/debian unstable/main amd64 libicu-dev amd64 72.1-6 [10.4 MB] Get: 257 http://deb.debian.org/debian unstable/main amd64 libboost-regex1.83-dev amd64 1.83.0-4 [346 kB] Get: 258 http://deb.debian.org/debian unstable/main amd64 libboost-test1.83.0 amd64 1.83.0-4 [471 kB] Get: 259 http://deb.debian.org/debian unstable/main amd64 libboost-test1.83-dev amd64 1.83.0-4 [541 kB] Get: 260 http://deb.debian.org/debian unstable/main amd64 libboost-graph1.83-dev amd64 1.83.0-4 [383 kB] Get: 261 http://deb.debian.org/debian unstable/main amd64 libboost-graph-dev amd64 1.83.0.2+b2 [3700 B] Get: 262 http://deb.debian.org/debian unstable/main amd64 libboost-iostreams1.83-dev amd64 1.83.0-4 [261 kB] Get: 263 http://deb.debian.org/debian unstable/main amd64 libboost-iostreams-dev amd64 1.83.0.2+b2 [3580 B] Get: 264 http://deb.debian.org/debian unstable/main amd64 libboost-program-options1.83.0 amd64 1.83.0-4 [347 kB] Get: 265 http://deb.debian.org/debian unstable/main amd64 libboost-program-options1.83-dev amd64 1.83.0-4 [375 kB] Get: 266 http://deb.debian.org/debian unstable/main amd64 libboost-program-options-dev amd64 1.83.0.2+b2 [3612 B] Get: 267 http://deb.debian.org/debian unstable/main amd64 libboost-python1.83.0 amd64 1.83.0-4 [320 kB] Get: 268 http://deb.debian.org/debian unstable/main amd64 libpython3.13 amd64 3.13.1-3 [2151 kB] Get: 269 http://deb.debian.org/debian unstable/main amd64 libexpat1-dev amd64 2.6.4-1 [158 kB] Get: 270 http://deb.debian.org/debian unstable/main amd64 zlib1g-dev amd64 1:1.3.dfsg+really1.3.1-1+b1 [920 kB] Get: 271 http://deb.debian.org/debian unstable/main amd64 libpython3.13-dev amd64 3.13.1-3 [5013 kB] Get: 272 http://deb.debian.org/debian unstable/main amd64 libpython3-dev amd64 3.13.1-2 [10.2 kB] Get: 273 http://deb.debian.org/debian unstable/main amd64 python3.13-dev amd64 3.13.1-3 [507 kB] Get: 274 http://deb.debian.org/debian unstable/main amd64 libjs-jquery all 3.6.1+dfsg+~3.5.14-1 [326 kB] Get: 275 http://deb.debian.org/debian unstable/main amd64 libjs-underscore all 1.13.4~dfsg+~1.11.4-3 [116 kB] Get: 276 http://deb.debian.org/debian unstable/main amd64 libjs-sphinxdoc all 8.1.3-4 [30.4 kB] Get: 277 http://deb.debian.org/debian unstable/main amd64 python3-dev amd64 3.13.1-2 [26.1 kB] Get: 278 http://deb.debian.org/debian unstable/main amd64 libboost-python1.83-dev amd64 1.83.0-4 [328 kB] Get: 279 http://deb.debian.org/debian unstable/main amd64 libboost-python-dev amd64 1.83.0.2+b2 [3892 B] Get: 280 http://deb.debian.org/debian unstable/main amd64 libboost-regex-dev amd64 1.83.0.2+b2 [3864 B] Get: 281 http://deb.debian.org/debian unstable/main amd64 libboost-system-dev amd64 1.83.0.2+b2 [3736 B] Get: 282 http://deb.debian.org/debian unstable/main amd64 libboost-thread-dev amd64 1.83.0.2+b2 [3624 B] Get: 283 http://deb.debian.org/debian unstable/main amd64 libbrotli-dev amd64 1.1.0-2+b6 [316 kB] Get: 284 http://deb.debian.org/debian unstable/main amd64 libbz2-dev amd64 1.0.8-6 [31.4 kB] Get: 285 http://deb.debian.org/debian unstable/main amd64 liblzo2-2 amd64 2.10-3+b1 [55.1 kB] Get: 286 http://deb.debian.org/debian unstable/main amd64 libcairo-script-interpreter2 amd64 1.18.2-2 [58.8 kB] Get: 287 http://deb.debian.org/debian unstable/main amd64 libpng-dev amd64 1.6.45-1 [367 kB] Get: 288 http://deb.debian.org/debian unstable/main amd64 libfreetype-dev amd64 2.13.3+dfsg-1 [622 kB] Get: 289 http://deb.debian.org/debian unstable/main amd64 libpkgconf3 amd64 1.8.1-4 [36.4 kB] Get: 290 http://deb.debian.org/debian unstable/main amd64 pkgconf-bin amd64 1.8.1-4 [30.2 kB] Get: 291 http://deb.debian.org/debian unstable/main amd64 pkgconf amd64 1.8.1-4 [26.2 kB] Get: 292 http://deb.debian.org/debian unstable/main amd64 libfontconfig-dev amd64 2.15.0-2 [414 kB] Get: 293 http://deb.debian.org/debian unstable/main amd64 libffi-dev amd64 3.4.6-1 [60.6 kB] Get: 294 http://deb.debian.org/debian unstable/main amd64 libsepol-dev amd64 3.7-1 [370 kB] Get: 295 http://deb.debian.org/debian unstable/main amd64 libpcre2-16-0 amd64 10.44-5 [260 kB] Get: 296 http://deb.debian.org/debian unstable/main amd64 libpcre2-32-0 amd64 10.44-5 [248 kB] Get: 297 http://deb.debian.org/debian unstable/main amd64 libpcre2-posix3 amd64 10.44-5 [60.4 kB] Get: 298 http://deb.debian.org/debian unstable/main amd64 libpcre2-dev amd64 10.44-5 [790 kB] Get: 299 http://deb.debian.org/debian unstable/main amd64 libselinux1-dev amd64 3.7-3+b1 [160 kB] Get: 300 http://deb.debian.org/debian unstable/main amd64 libmount-dev amd64 2.40.4-1 [29.3 kB] Get: 301 http://deb.debian.org/debian unstable/main amd64 libsysprof-capture-4-dev amd64 47.2-1 [47.7 kB] Get: 302 http://deb.debian.org/debian unstable/main amd64 libgio-2.0-dev amd64 2.82.4-2 [1677 kB] Get: 303 http://deb.debian.org/debian unstable/main amd64 libglib2.0-data all 2.82.4-2 [1276 kB] Get: 304 http://deb.debian.org/debian unstable/main amd64 libglib2.0-bin amd64 2.82.4-2 [127 kB] Get: 305 http://deb.debian.org/debian unstable/main amd64 python3-packaging all 24.2-1 [55.3 kB] Get: 306 http://deb.debian.org/debian unstable/main amd64 libgio-2.0-dev-bin amd64 2.82.4-2 [163 kB] Get: 307 http://deb.debian.org/debian unstable/main amd64 libglib2.0-dev-bin amd64 2.82.4-2 [52.1 kB] Get: 308 http://deb.debian.org/debian unstable/main amd64 libglib2.0-dev amd64 2.82.4-2 [52.9 kB] Get: 309 http://deb.debian.org/debian unstable/main amd64 libpixman-1-dev amd64 0.44.0-3 [11.4 kB] Get: 310 http://deb.debian.org/debian unstable/main amd64 xorg-sgml-doctools all 1:1.11-1.1 [22.1 kB] Get: 311 http://deb.debian.org/debian unstable/main amd64 x11proto-dev all 2024.1-1 [603 kB] Get: 312 http://deb.debian.org/debian unstable/main amd64 x11proto-core-dev all 2024.1-1 [3312 B] Get: 313 http://deb.debian.org/debian unstable/main amd64 libice-dev amd64 2:1.1.1-1 [73.8 kB] Get: 314 http://deb.debian.org/debian unstable/main amd64 libsm-dev amd64 2:1.2.4-1 [37.7 kB] Get: 315 http://deb.debian.org/debian unstable/main amd64 libxau-dev amd64 1:1.0.11-1 [23.6 kB] Get: 316 http://deb.debian.org/debian unstable/main amd64 libxdmcp-dev amd64 1:1.1.5-1 [44.3 kB] Get: 317 http://deb.debian.org/debian unstable/main amd64 xtrans-dev all 1.4.0-1 [98.7 kB] Get: 318 http://deb.debian.org/debian unstable/main amd64 libxcb1-dev amd64 1.17.0-2+b1 [181 kB] Get: 319 http://deb.debian.org/debian unstable/main amd64 libx11-dev amd64 2:1.8.10-2 [891 kB] Get: 320 http://deb.debian.org/debian unstable/main amd64 libxcb-render0-dev amd64 1.17.0-2+b1 [118 kB] Get: 321 http://deb.debian.org/debian unstable/main amd64 libxcb-shm0-dev amd64 1.17.0-2+b1 [108 kB] Get: 322 http://deb.debian.org/debian unstable/main amd64 libxext-dev amd64 2:1.3.4-1+b3 [104 kB] Get: 323 http://deb.debian.org/debian unstable/main amd64 libxrender-dev amd64 1:0.9.10-1.1+b3 [35.9 kB] Get: 324 http://deb.debian.org/debian unstable/main amd64 libcairo2-dev amd64 1.18.2-2 [43.0 kB] Get: 325 http://deb.debian.org/debian unstable/main amd64 libcairomm-1.0-1v5 amd64 1.14.5-2+b1 [57.3 kB] Get: 326 http://deb.debian.org/debian unstable/main amd64 libsigc++-2.0-dev amd64 2.12.1-3 [72.3 kB] Get: 327 http://deb.debian.org/debian unstable/main amd64 libcairomm-1.0-dev amd64 1.14.5-2+b1 [69.8 kB] Get: 328 http://deb.debian.org/debian unstable/main amd64 libgmpxx4ldbl amd64 2:6.3.0+dfsg-3 [329 kB] Get: 329 http://deb.debian.org/debian unstable/main amd64 libgmp-dev amd64 2:6.3.0+dfsg-3 [642 kB] Get: 330 http://deb.debian.org/debian unstable/main amd64 libmpfr-dev amd64 4.2.1-1+b2 [268 kB] Get: 331 http://deb.debian.org/debian unstable/main amd64 libcgal-dev amd64 6.0.1-1 [5115 kB] Get: 332 http://deb.debian.org/debian unstable/main amd64 libcommons-parent-java all 56-1 [10.8 kB] Get: 333 http://deb.debian.org/debian unstable/main amd64 libcommons-logging-java all 1.3.0-1 [68.6 kB] Get: 334 http://deb.debian.org/debian unstable/main amd64 libnghttp2-14 amd64 1.64.0-1 [75.5 kB] Get: 335 http://deb.debian.org/debian unstable/main amd64 libnghttp3-9 amd64 1.6.0-2 [64.8 kB] Get: 336 http://deb.debian.org/debian unstable/main amd64 libngtcp2-16 amd64 1.9.1-1 [119 kB] Get: 337 http://deb.debian.org/debian unstable/main amd64 libngtcp2-crypto-gnutls8 amd64 1.9.1-1 [18.5 kB] Get: 338 http://deb.debian.org/debian unstable/main amd64 libpsl5t64 amd64 0.21.2-1.1+b1 [57.2 kB] Get: 339 http://deb.debian.org/debian unstable/main amd64 librtmp1 amd64 2.4+20151223.gitfa8646d.1-2+b5 [58.8 kB] Get: 340 http://deb.debian.org/debian unstable/main amd64 libssh2-1t64 amd64 1.11.1-1 [245 kB] Get: 341 http://deb.debian.org/debian unstable/main amd64 libcurl3t64-gnutls amd64 8.11.1-1+b1 [360 kB] Get: 342 http://deb.debian.org/debian unstable/main amd64 libdav1d7 amd64 1.5.0-1+b1 [550 kB] Get: 343 http://deb.debian.org/debian unstable/main amd64 libfontbox-java all 1:1.8.16-5 [211 kB] Get: 344 http://deb.debian.org/debian unstable/main amd64 libgfortran5 amd64 14.2.0-14 [837 kB] Get: 345 http://deb.debian.org/debian unstable/main amd64 libgpgme11t64 amd64 1.24.1-2 [344 kB] Get: 346 http://deb.debian.org/debian unstable/main amd64 libgpgmepp6t64 amd64 1.24.1-2 [340 kB] Get: 347 http://deb.debian.org/debian unstable/main amd64 libimagequant0 amd64 2.18.0-1+b2 [35.2 kB] Get: 348 http://deb.debian.org/debian unstable/main amd64 libjs-jquery-ui all 1.13.2+dfsg-1 [250 kB] Get: 349 http://deb.debian.org/debian unstable/main amd64 libjs-mathjax all 2.7.9+dfsg-1 [5667 kB] Get: 350 http://deb.debian.org/debian unstable/main amd64 libjson-perl all 4.10000-1 [87.5 kB] Get: 351 http://deb.debian.org/debian unstable/main amd64 liblapack3 amd64 3.12.0-4 [2450 kB] Get: 352 http://deb.debian.org/debian unstable/main amd64 liblbfgsb0 amd64 3.0+dfsg.4-1+b2 [29.4 kB] Get: 353 http://deb.debian.org/debian unstable/main amd64 libnspr4 amd64 2:4.36-1 [110 kB] Get: 354 http://deb.debian.org/debian unstable/main amd64 libnss3 amd64 2:3.107-1 [1390 kB] Get: 355 http://deb.debian.org/debian unstable/main amd64 libopenjp2-7 amd64 2.5.0-2+b4 [199 kB] Get: 356 http://deb.debian.org/debian unstable/main amd64 libpdfbox-java all 1:1.8.16-5 [5527 kB] Get: 357 http://deb.debian.org/debian unstable/main amd64 libpoppler140 amd64 24.08.0-4 [1965 kB] Get: 358 http://deb.debian.org/debian unstable/main amd64 libqhull-r8.0 amd64 2020.2-6+b2 [248 kB] Get: 359 http://deb.debian.org/debian unstable/main amd64 libraqm0 amd64 0.10.2-1 [13.9 kB] Get: 360 http://deb.debian.org/debian unstable/main amd64 librsvg2-2 amd64 2.59.2+dfsg-1 [1854 kB] Get: 361 http://deb.debian.org/debian unstable/main amd64 librsvg2-common amd64 2.59.2+dfsg-1 [152 kB] Get: 362 http://deb.debian.org/debian unstable/main amd64 libsparsehash-dev all 2.0.3-2 [76.8 kB] Get: 363 http://deb.debian.org/debian unstable/main amd64 libvpx9 amd64 1.15.0-1 [1115 kB] Get: 364 http://deb.debian.org/debian unstable/main amd64 libwebpdemux2 amd64 1.5.0-0.1 [113 kB] Get: 365 http://deb.debian.org/debian unstable/main amd64 libwebpmux3 amd64 1.5.0-0.1 [126 kB] Get: 366 http://deb.debian.org/debian unstable/main amd64 libxslt1.1 amd64 1.1.35-1.1+b1 [233 kB] Get: 367 http://deb.debian.org/debian unstable/main amd64 poppler-utils amd64 24.08.0-4 [213 kB] Get: 368 http://deb.debian.org/debian unstable/main amd64 preview-latex-style all 13.2-1 [350 kB] Get: 369 http://deb.debian.org/debian unstable/main amd64 python-babel-localedata all 2.16.0-1 [5696 kB] Get: 370 http://deb.debian.org/debian unstable/main amd64 sphinx-rtd-theme-common all 3.0.2+dfsg-2 [1023 kB] Get: 371 http://deb.debian.org/debian unstable/main amd64 python-ipython-doc all 8.30.0-2 [3496 kB] Get: 372 http://deb.debian.org/debian unstable/main amd64 python-matplotlib-data all 3.8.3-3 [2731 kB] Get: 373 http://deb.debian.org/debian unstable/main amd64 python-mpltoolkits.basemap-doc all 1.2.2+dfsg-5 [35.8 MB] Get: 374 http://deb.debian.org/debian unstable/main amd64 python-pandas-doc all 2.2.3+dfsg-5 [9245 kB] Get: 375 http://deb.debian.org/debian unstable/main amd64 python-scipy-doc all 1.14.1-3 [21.3 MB] Get: 376 http://deb.debian.org/debian unstable/main amd64 python3-alabaster all 0.7.16-0.1 [27.9 kB] Get: 377 http://deb.debian.org/debian unstable/main amd64 python3-attr all 24.3.0-1 [68.8 kB] Get: 378 http://deb.debian.org/debian unstable/main amd64 python3-babel all 2.16.0-1 [114 kB] Get: 379 http://deb.debian.org/debian unstable/main amd64 python3-brotli amd64 1.1.0-2+b6 [321 kB] Get: 380 http://deb.debian.org/debian unstable/main amd64 python3-cairo amd64 1.26.1-2+b1 [130 kB] Get: 381 http://deb.debian.org/debian unstable/main amd64 python3-cairo-dev all 1.26.1-2 [14.4 kB] Get: 382 http://deb.debian.org/debian unstable/main amd64 python3-cairo-doc all 1.26.1-2 [639 kB] Get: 383 http://deb.debian.org/debian unstable/main amd64 python3-certifi all 2024.12.14+ds-1 [9624 B] Get: 384 http://deb.debian.org/debian unstable/main amd64 python3-chardet all 5.2.0+dfsg-2 [108 kB] Get: 385 http://deb.debian.org/debian unstable/main amd64 python3-charset-normalizer amd64 3.4.0-1+b1 [140 kB] Get: 386 http://deb.debian.org/debian unstable/main amd64 python3-numpy amd64 1:1.26.4+ds-13 [4736 kB] Get: 387 http://deb.debian.org/debian unstable/main amd64 python3-contourpy amd64 1.3.1-1 [264 kB] Get: 388 http://deb.debian.org/debian unstable/main amd64 python3-cycler all 0.12.1-1 [9496 B] Get: 389 http://deb.debian.org/debian unstable/main amd64 python3-dateutil all 2.9.0-3 [79.3 kB] Get: 390 http://deb.debian.org/debian unstable/main amd64 python3-decorator all 5.1.1-5 [15.1 kB] Get: 391 http://deb.debian.org/debian unstable/main amd64 python3-defusedxml all 0.7.1-3 [43.4 kB] Get: 392 http://deb.debian.org/debian unstable/main amd64 python3.13-doc all 3.13.1-3 [15.2 MB] Get: 393 http://deb.debian.org/debian unstable/main amd64 python3-doc all 3.13.1-2 [10.1 kB] Get: 394 http://deb.debian.org/debian unstable/main amd64 python3-roman all 4.2-1 [10.4 kB] Get: 395 http://deb.debian.org/debian unstable/main amd64 python3-docutils all 0.21.2+dfsg-2 [403 kB] Get: 396 http://deb.debian.org/debian unstable/main amd64 python3-tz all 2024.2-1 [31.0 kB] Get: 397 http://deb.debian.org/debian unstable/main amd64 python3-platformdirs all 4.3.6-1 [16.6 kB] Get: 398 http://deb.debian.org/debian unstable/main amd64 python3-fs all 2.4.16-6 [95.1 kB] Get: 399 http://deb.debian.org/debian unstable/main amd64 python3-lxml amd64 5.3.0-1+b1 [1676 kB] Get: 400 http://deb.debian.org/debian unstable/main amd64 python3-lz4 amd64 4.4.0+dfsg-1 [25.5 kB] Get: 401 http://deb.debian.org/debian unstable/main amd64 python3-scipy amd64 1.14.1-3 [20.5 MB] Get: 402 http://deb.debian.org/debian unstable/main amd64 python3-mpmath all 1.3.0-1 [419 kB] Get: 403 http://deb.debian.org/debian unstable/main amd64 python3-sympy all 1.13.3-1 [4147 kB] Get: 404 http://deb.debian.org/debian unstable/main amd64 python3-ufolib2 all 0.17.0+dfsg1-1 [33.0 kB] Get: 405 http://deb.debian.org/debian unstable/main amd64 python3-unicodedata2 amd64 15.1.0+ds-1+b3 [299 kB] Get: 406 http://deb.debian.org/debian unstable/main amd64 unicode-data all 15.1.0-1 [8547 kB] Get: 407 http://deb.debian.org/debian unstable/main amd64 python3-fonttools amd64 4.55.3-2 [1633 kB] Get: 408 http://deb.debian.org/debian unstable/main amd64 python3-gi amd64 3.50.0-4 [264 kB] Get: 409 http://deb.debian.org/debian unstable/main amd64 python3-idna all 3.8-2 [41.6 kB] Get: 410 http://deb.debian.org/debian unstable/main amd64 python3-imagesize all 1.4.1-1 [6688 B] Get: 411 http://deb.debian.org/debian unstable/main amd64 python3-markupsafe amd64 2.1.5-1+b2 [13.9 kB] Get: 412 http://deb.debian.org/debian unstable/main amd64 python3-jinja2 all 3.1.5-1 [107 kB] Get: 413 http://deb.debian.org/debian unstable/main amd64 python3-kiwisolver amd64 1.4.7-2+b1 [77.0 kB] Get: 414 http://deb.debian.org/debian unstable/main amd64 python3-pil amd64 11.1.0-1 [306 kB] Get: 415 http://deb.debian.org/debian unstable/main amd64 python3.12-tk amd64 3.12.8-5 [113 kB] Get: 416 http://deb.debian.org/debian unstable/main amd64 python3.13-tk amd64 3.13.1-3 [103 kB] Get: 417 http://deb.debian.org/debian unstable/main amd64 python3-tk amd64 3.13.1-1 [9464 B] Get: 418 http://deb.debian.org/debian unstable/main amd64 python3-pil.imagetk amd64 11.1.0-1 [81.3 kB] Get: 419 http://deb.debian.org/debian unstable/main amd64 python3-pyparsing all 3.1.2-1 [146 kB] Get: 420 http://deb.debian.org/debian unstable/main amd64 python3-matplotlib amd64 3.8.3-3+b1 [5654 kB] Get: 421 http://deb.debian.org/debian unstable/main amd64 sphinx-common all 8.1.3-4 [616 kB] Get: 422 http://deb.debian.org/debian unstable/main amd64 python3-pygments all 2.18.0+dfsg-2 [836 kB] Get: 423 http://deb.debian.org/debian unstable/main amd64 python3-urllib3 all 2.3.0-1 [114 kB] Get: 424 http://deb.debian.org/debian unstable/main amd64 python3-requests all 2.32.3+dfsg-1 [71.9 kB] Get: 425 http://deb.debian.org/debian unstable/main amd64 python3-snowballstemmer all 2.2.0-4 [58.0 kB] Get: 426 http://deb.debian.org/debian unstable/main amd64 python3-sphinx all 8.1.3-4 [468 kB] Get: 427 http://deb.debian.org/debian unstable/main amd64 python3-tabulate all 0.9.0-1 [45.9 kB] Get: 428 http://deb.debian.org/debian unstable/main amd64 python3-numpydoc all 1.8.0-1 [51.4 kB] Get: 429 http://deb.debian.org/debian unstable/main amd64 texlive-fonts-recommended all 2024.20250114-1 [4991 kB] Get: 430 http://deb.debian.org/debian unstable/main amd64 texlive-pictures all 2024.20250114-1 [17.1 MB] Get: 431 http://deb.debian.org/debian unstable/main amd64 texlive-latex-extra all 2024.20250114-1 [24.7 MB] Get: 432 http://deb.debian.org/debian unstable/main amd64 vpx-tools amd64 1.15.0-1 [308 kB] Get: 433 http://deb.debian.org/debian unstable/main amd64 zstd amd64 1.5.6+dfsg-2 [737 kB] Fetched 407 MB in 5s (88.2 MB/s) Preconfiguring packages ... Selecting previously unselected package libsystemd-shared:amd64. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19831 files and directories currently installed.) Preparing to unpack .../libsystemd-shared_257.2-2_amd64.deb ... Unpacking libsystemd-shared:amd64 (257.2-2) ... Selecting previously unselected package libapparmor1:amd64. Preparing to unpack .../libapparmor1_3.1.7-1+b3_amd64.deb ... Unpacking libapparmor1:amd64 (3.1.7-1+b3) ... Setting up libsystemd-shared:amd64 (257.2-2) ... Selecting previously unselected package systemd. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19845 files and directories currently installed.) Preparing to unpack .../systemd_257.2-2_amd64.deb ... Unpacking systemd (257.2-2) ... Setting up libapparmor1:amd64 (3.1.7-1+b3) ... Setting up systemd (257.2-2) ... Created symlink '/etc/systemd/system/getty.target.wants/getty@tty1.service' -> '/usr/lib/systemd/system/getty@.service'. Created symlink '/etc/systemd/system/multi-user.target.wants/remote-fs.target' -> '/usr/lib/systemd/system/remote-fs.target'. Created symlink '/etc/systemd/system/sysinit.target.wants/systemd-pstore.service' -> '/usr/lib/systemd/system/systemd-pstore.service'. Initializing machine ID from random generator. Creating group 'systemd-journal' with GID 999. Creating group 'systemd-network' with GID 998. Creating user 'systemd-network' (systemd Network Management) with UID 998 and GID 998. /usr/lib/tmpfiles.d/legacy.conf:14: Duplicate line for path "/run/lock", ignoring. Selecting previously unselected package systemd-sysv. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 20788 files and directories currently installed.) Preparing to unpack .../00-systemd-sysv_257.2-2_amd64.deb ... Unpacking systemd-sysv (257.2-2) ... Selecting previously unselected package libdbus-1-3:amd64. Preparing to unpack .../01-libdbus-1-3_1.16.0-1_amd64.deb ... Unpacking libdbus-1-3:amd64 (1.16.0-1) ... Selecting previously unselected package dbus-bin. Preparing to unpack .../02-dbus-bin_1.16.0-1_amd64.deb ... Unpacking dbus-bin (1.16.0-1) ... Selecting previously unselected package dbus-session-bus-common. Preparing to unpack .../03-dbus-session-bus-common_1.16.0-1_all.deb ... Unpacking dbus-session-bus-common (1.16.0-1) ... Selecting previously unselected package libexpat1:amd64. Preparing to unpack .../04-libexpat1_2.6.4-1_amd64.deb ... Unpacking libexpat1:amd64 (2.6.4-1) ... Selecting previously unselected package dbus-daemon. Preparing to unpack .../05-dbus-daemon_1.16.0-1_amd64.deb ... Unpacking dbus-daemon (1.16.0-1) ... Selecting previously unselected package dbus-system-bus-common. Preparing to unpack .../06-dbus-system-bus-common_1.16.0-1_all.deb ... Unpacking dbus-system-bus-common (1.16.0-1) ... Selecting previously unselected package dbus. Preparing to unpack .../07-dbus_1.16.0-1_amd64.deb ... Unpacking dbus (1.16.0-1) ... Selecting previously unselected package autoconf-archive. Preparing to unpack .../08-autoconf-archive_20220903-3_all.deb ... Unpacking autoconf-archive (20220903-3) ... Selecting previously unselected package fonts-lato. Preparing to unpack .../09-fonts-lato_2.015-1_all.deb ... Unpacking fonts-lato (2.015-1) ... Selecting previously unselected package libpython3.13-minimal:amd64. Preparing to unpack .../10-libpython3.13-minimal_3.13.1-3_amd64.deb ... Unpacking libpython3.13-minimal:amd64 (3.13.1-3) ... Selecting previously unselected package python3.13-minimal. Preparing to unpack .../11-python3.13-minimal_3.13.1-3_amd64.deb ... Unpacking python3.13-minimal (3.13.1-3) ... Setting up libpython3.13-minimal:amd64 (3.13.1-3) ... Setting up libexpat1:amd64 (2.6.4-1) ... Setting up python3.13-minimal (3.13.1-3) ... Selecting previously unselected package python3-minimal. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 22422 files and directories currently installed.) Preparing to unpack .../0-python3-minimal_3.13.1-2_amd64.deb ... Unpacking python3-minimal (3.13.1-2) ... Selecting previously unselected package media-types. Preparing to unpack .../1-media-types_10.1.0_all.deb ... Unpacking media-types (10.1.0) ... Selecting previously unselected package netbase. Preparing to unpack .../2-netbase_6.4_all.deb ... Unpacking netbase (6.4) ... Selecting previously unselected package tzdata. Preparing to unpack .../3-tzdata_2025a-1_all.deb ... Unpacking tzdata (2025a-1) ... Selecting previously unselected package libffi8:amd64. Preparing to unpack .../4-libffi8_3.4.6-1_amd64.deb ... Unpacking libffi8:amd64 (3.4.6-1) ... Selecting previously unselected package readline-common. Preparing to unpack .../5-readline-common_8.2-6_all.deb ... Unpacking readline-common (8.2-6) ... Selecting previously unselected package libreadline8t64:amd64. Preparing to unpack .../6-libreadline8t64_8.2-6_amd64.deb ... Adding 'diversion of /lib/x86_64-linux-gnu/libhistory.so.8 to /lib/x86_64-linux-gnu/libhistory.so.8.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/x86_64-linux-gnu/libhistory.so.8.2 to /lib/x86_64-linux-gnu/libhistory.so.8.2.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/x86_64-linux-gnu/libreadline.so.8 to /lib/x86_64-linux-gnu/libreadline.so.8.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/x86_64-linux-gnu/libreadline.so.8.2 to /lib/x86_64-linux-gnu/libreadline.so.8.2.usr-is-merged by libreadline8t64' Unpacking libreadline8t64:amd64 (8.2-6) ... Selecting previously unselected package libpython3.13-stdlib:amd64. Preparing to unpack .../7-libpython3.13-stdlib_3.13.1-3_amd64.deb ... Unpacking libpython3.13-stdlib:amd64 (3.13.1-3) ... Selecting previously unselected package python3.13. Preparing to unpack .../8-python3.13_3.13.1-3_amd64.deb ... Unpacking python3.13 (3.13.1-3) ... Selecting previously unselected package libpython3-stdlib:amd64. Preparing to unpack .../9-libpython3-stdlib_3.13.1-2_amd64.deb ... Unpacking libpython3-stdlib:amd64 (3.13.1-2) ... Setting up python3-minimal (3.13.1-2) ... Selecting previously unselected package python3. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 23432 files and directories currently installed.) Preparing to unpack .../000-python3_3.13.1-2_amd64.deb ... Unpacking python3 (3.13.1-2) ... Selecting previously unselected package sgml-base. Preparing to unpack .../001-sgml-base_1.31_all.deb ... Unpacking sgml-base (1.31) ... Selecting previously unselected package libproc2-0:amd64. Preparing to unpack .../002-libproc2-0_2%3a4.0.4-6_amd64.deb ... Unpacking libproc2-0:amd64 (2:4.0.4-6) ... Selecting previously unselected package procps. Preparing to unpack .../003-procps_2%3a4.0.4-6_amd64.deb ... Unpacking procps (2:4.0.4-6) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../004-sensible-utils_0.0.24_all.deb ... Unpacking sensible-utils (0.0.24) ... Selecting previously unselected package openssl. Preparing to unpack .../005-openssl_3.4.0-2_amd64.deb ... Unpacking openssl (3.4.0-2) ... Selecting previously unselected package ca-certificates. Preparing to unpack .../006-ca-certificates_20241223_all.deb ... Unpacking ca-certificates (20241223) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../007-libmagic-mgc_1%3a5.45-3+b1_amd64.deb ... Unpacking libmagic-mgc (1:5.45-3+b1) ... Selecting previously unselected package libmagic1t64:amd64. Preparing to unpack .../008-libmagic1t64_1%3a5.45-3+b1_amd64.deb ... Unpacking libmagic1t64:amd64 (1:5.45-3+b1) ... Selecting previously unselected package file. Preparing to unpack .../009-file_1%3a5.45-3+b1_amd64.deb ... Unpacking file (1:5.45-3+b1) ... Selecting previously unselected package gettext-base. Preparing to unpack .../010-gettext-base_0.23.1-1_amd64.deb ... Unpacking gettext-base (0.23.1-1) ... Selecting previously unselected package libuchardet0:amd64. Preparing to unpack .../011-libuchardet0_0.0.8-1+b2_amd64.deb ... Unpacking libuchardet0:amd64 (0.0.8-1+b2) ... Selecting previously unselected package groff-base. Preparing to unpack .../012-groff-base_1.23.0-7_amd64.deb ... Unpacking groff-base (1.23.0-7) ... Selecting previously unselected package libpam-systemd:amd64. Preparing to unpack .../013-libpam-systemd_257.2-2_amd64.deb ... Unpacking libpam-systemd:amd64 (257.2-2) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../014-bsdextrautils_2.40.4-1_amd64.deb ... Unpacking bsdextrautils (2.40.4-1) ... Selecting previously unselected package libpipeline1:amd64. Preparing to unpack .../015-libpipeline1_1.5.8-1_amd64.deb ... Unpacking libpipeline1:amd64 (1.5.8-1) ... Selecting previously unselected package man-db. Preparing to unpack .../016-man-db_2.13.0-1_amd64.deb ... Unpacking man-db (2.13.0-1) ... Selecting previously unselected package libtext-charwidth-perl:amd64. Preparing to unpack .../017-libtext-charwidth-perl_0.04-11+b4_amd64.deb ... Unpacking libtext-charwidth-perl:amd64 (0.04-11+b4) ... Selecting previously unselected package libtext-wrapi18n-perl. Preparing to unpack .../018-libtext-wrapi18n-perl_0.06-10_all.deb ... Unpacking libtext-wrapi18n-perl (0.06-10) ... Selecting previously unselected package ucf. Preparing to unpack .../019-ucf_3.0048_all.deb ... Moving old data out of the way Unpacking ucf (3.0048) ... Selecting previously unselected package libgdk-pixbuf2.0-common. Preparing to unpack .../020-libgdk-pixbuf2.0-common_2.42.12+dfsg-2_all.deb ... Unpacking libgdk-pixbuf2.0-common (2.42.12+dfsg-2) ... Selecting previously unselected package libglib2.0-0t64:amd64. Preparing to unpack .../021-libglib2.0-0t64_2.82.4-2_amd64.deb ... Unpacking libglib2.0-0t64:amd64 (2.82.4-2) ... Selecting previously unselected package libicu72:amd64. Preparing to unpack .../022-libicu72_72.1-6_amd64.deb ... Unpacking libicu72:amd64 (72.1-6) ... Selecting previously unselected package libxml2:amd64. Preparing to unpack .../023-libxml2_2.12.7+dfsg+really2.9.14-0.2+b1_amd64.deb ... Unpacking libxml2:amd64 (2.12.7+dfsg+really2.9.14-0.2+b1) ... Selecting previously unselected package shared-mime-info. Preparing to unpack .../024-shared-mime-info_2.4-5+b1_amd64.deb ... Unpacking shared-mime-info (2.4-5+b1) ... Selecting previously unselected package libjpeg62-turbo:amd64. Preparing to unpack .../025-libjpeg62-turbo_1%3a2.1.5-3+b1_amd64.deb ... Unpacking libjpeg62-turbo:amd64 (1:2.1.5-3+b1) ... Selecting previously unselected package libpng16-16t64:amd64. Preparing to unpack .../026-libpng16-16t64_1.6.45-1_amd64.deb ... Unpacking libpng16-16t64:amd64 (1.6.45-1) ... Selecting previously unselected package libdeflate0:amd64. Preparing to unpack .../027-libdeflate0_1.23-1+b1_amd64.deb ... Unpacking libdeflate0:amd64 (1.23-1+b1) ... Selecting previously unselected package libjbig0:amd64. Preparing to unpack .../028-libjbig0_2.1-6.1+b2_amd64.deb ... Unpacking libjbig0:amd64 (2.1-6.1+b2) ... Selecting previously unselected package liblerc4:amd64. Preparing to unpack .../029-liblerc4_4.0.0+ds-5_amd64.deb ... Unpacking liblerc4:amd64 (4.0.0+ds-5) ... Selecting previously unselected package libsharpyuv0:amd64. Preparing to unpack .../030-libsharpyuv0_1.5.0-0.1_amd64.deb ... Unpacking libsharpyuv0:amd64 (1.5.0-0.1) ... Selecting previously unselected package libwebp7:amd64. Preparing to unpack .../031-libwebp7_1.5.0-0.1_amd64.deb ... Unpacking libwebp7:amd64 (1.5.0-0.1) ... Selecting previously unselected package libtiff6:amd64. Preparing to unpack .../032-libtiff6_4.5.1+git230720-5_amd64.deb ... Unpacking libtiff6:amd64 (4.5.1+git230720-5) ... Selecting previously unselected package libgdk-pixbuf-2.0-0:amd64. Preparing to unpack .../033-libgdk-pixbuf-2.0-0_2.42.12+dfsg-2_amd64.deb ... Unpacking libgdk-pixbuf-2.0-0:amd64 (2.42.12+dfsg-2) ... Selecting previously unselected package gtk-update-icon-cache. Preparing to unpack .../034-gtk-update-icon-cache_4.16.12+ds-1_amd64.deb ... No diversion 'diversion of /usr/sbin/update-icon-caches to /usr/sbin/update-icon-caches.gtk2 by libgtk-3-bin', none removed. No diversion 'diversion of /usr/share/man/man8/update-icon-caches.8.gz to /usr/share/man/man8/update-icon-caches.gtk2.8.gz by libgtk-3-bin', none removed. Unpacking gtk-update-icon-cache (4.16.12+ds-1) ... Selecting previously unselected package hicolor-icon-theme. Preparing to unpack .../035-hicolor-icon-theme_0.18-2_all.deb ... Unpacking hicolor-icon-theme (0.18-2) ... Selecting previously unselected package adwaita-icon-theme. Preparing to unpack .../036-adwaita-icon-theme_47.0-2_all.deb ... Unpacking adwaita-icon-theme (47.0-2) ... Selecting previously unselected package at-spi2-common. Preparing to unpack .../037-at-spi2-common_2.55.0.1-1_all.deb ... Unpacking at-spi2-common (2.55.0.1-1) ... Selecting previously unselected package m4. Preparing to unpack .../038-m4_1.4.19-5_amd64.deb ... Unpacking m4 (1.4.19-5) ... Selecting previously unselected package autoconf. Preparing to unpack .../039-autoconf_2.72-3_all.deb ... Unpacking autoconf (2.72-3) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../040-autotools-dev_20220109.1_all.deb ... Unpacking autotools-dev (20220109.1) ... Selecting previously unselected package automake. Preparing to unpack .../041-automake_1%3a1.16.5-1.3_all.deb ... Unpacking automake (1:1.16.5-1.3) ... Selecting previously unselected package autopoint. Preparing to unpack .../042-autopoint_0.23.1-1_all.deb ... Unpacking autopoint (0.23.1-1) ... Selecting previously unselected package libtcl8.6:amd64. Preparing to unpack .../043-libtcl8.6_8.6.16+dfsg-1_amd64.deb ... Unpacking libtcl8.6:amd64 (8.6.16+dfsg-1) ... Selecting previously unselected package libbrotli1:amd64. Preparing to unpack .../044-libbrotli1_1.1.0-2+b6_amd64.deb ... Unpacking libbrotli1:amd64 (1.1.0-2+b6) ... Selecting previously unselected package libfreetype6:amd64. Preparing to unpack .../045-libfreetype6_2.13.3+dfsg-1_amd64.deb ... Unpacking libfreetype6:amd64 (2.13.3+dfsg-1) ... Selecting previously unselected package fonts-dejavu-mono. Preparing to unpack .../046-fonts-dejavu-mono_2.37-8_all.deb ... Unpacking fonts-dejavu-mono (2.37-8) ... Selecting previously unselected package fonts-dejavu-core. Preparing to unpack .../047-fonts-dejavu-core_2.37-8_all.deb ... Unpacking fonts-dejavu-core (2.37-8) ... Selecting previously unselected package fontconfig-config. Preparing to unpack .../048-fontconfig-config_2.15.0-2_amd64.deb ... Unpacking fontconfig-config (2.15.0-2) ... Selecting previously unselected package libfontconfig1:amd64. Preparing to unpack .../049-libfontconfig1_2.15.0-2_amd64.deb ... Unpacking libfontconfig1:amd64 (2.15.0-2) ... Selecting previously unselected package libxau6:amd64. Preparing to unpack .../050-libxau6_1%3a1.0.11-1_amd64.deb ... Unpacking libxau6:amd64 (1:1.0.11-1) ... Selecting previously unselected package libxdmcp6:amd64. Preparing to unpack .../051-libxdmcp6_1%3a1.1.5-1_amd64.deb ... Unpacking libxdmcp6:amd64 (1:1.1.5-1) ... Selecting previously unselected package libxcb1:amd64. Preparing to unpack .../052-libxcb1_1.17.0-2+b1_amd64.deb ... Unpacking libxcb1:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libx11-data. Preparing to unpack .../053-libx11-data_2%3a1.8.10-2_all.deb ... Unpacking libx11-data (2:1.8.10-2) ... Selecting previously unselected package libx11-6:amd64. Preparing to unpack .../054-libx11-6_2%3a1.8.10-2_amd64.deb ... Unpacking libx11-6:amd64 (2:1.8.10-2) ... Selecting previously unselected package libxrender1:amd64. Preparing to unpack .../055-libxrender1_1%3a0.9.10-1.1+b3_amd64.deb ... Unpacking libxrender1:amd64 (1:0.9.10-1.1+b3) ... Selecting previously unselected package libxft2:amd64. Preparing to unpack .../056-libxft2_2.3.6-1+b3_amd64.deb ... Unpacking libxft2:amd64 (2.3.6-1+b3) ... Selecting previously unselected package libxext6:amd64. Preparing to unpack .../057-libxext6_2%3a1.3.4-1+b3_amd64.deb ... Unpacking libxext6:amd64 (2:1.3.4-1+b3) ... Selecting previously unselected package x11-common. Preparing to unpack .../058-x11-common_1%3a7.7+23.2_all.deb ... Unpacking x11-common (1:7.7+23.2) ... Selecting previously unselected package libxss1:amd64. Preparing to unpack .../059-libxss1_1%3a1.2.3-1+b3_amd64.deb ... Unpacking libxss1:amd64 (1:1.2.3-1+b3) ... Selecting previously unselected package libtk8.6:amd64. Preparing to unpack .../060-libtk8.6_8.6.16-1_amd64.deb ... Unpacking libtk8.6:amd64 (8.6.16-1) ... Selecting previously unselected package tk8.6-blt2.5. Preparing to unpack .../061-tk8.6-blt2.5_2.5.3+dfsg-7_amd64.deb ... Unpacking tk8.6-blt2.5 (2.5.3+dfsg-7) ... Selecting previously unselected package blt. Preparing to unpack .../062-blt_2.5.3+dfsg-7_amd64.deb ... Unpacking blt (2.5.3+dfsg-7) ... Selecting previously unselected package tex-common. Preparing to unpack .../063-tex-common_6.18_all.deb ... Unpacking tex-common (6.18) ... Selecting previously unselected package libpaper2:amd64. Preparing to unpack .../064-libpaper2_2.2.5-0.3_amd64.deb ... Unpacking libpaper2:amd64 (2.2.5-0.3) ... Selecting previously unselected package libpaper-utils. Preparing to unpack .../065-libpaper-utils_2.2.5-0.3_amd64.deb ... Unpacking libpaper-utils (2.2.5-0.3) ... Selecting previously unselected package libkpathsea6:amd64. Preparing to unpack .../066-libkpathsea6_2024.20240313.70630+ds-5+b1_amd64.deb ... Unpacking libkpathsea6:amd64 (2024.20240313.70630+ds-5+b1) ... Selecting previously unselected package libptexenc1:amd64. Preparing to unpack .../067-libptexenc1_2024.20240313.70630+ds-5+b1_amd64.deb ... Unpacking libptexenc1:amd64 (2024.20240313.70630+ds-5+b1) ... Selecting previously unselected package libsynctex2:amd64. Preparing to unpack .../068-libsynctex2_2024.20240313.70630+ds-5+b1_amd64.deb ... Unpacking libsynctex2:amd64 (2024.20240313.70630+ds-5+b1) ... Selecting previously unselected package libtexlua53-5:amd64. Preparing to unpack .../069-libtexlua53-5_2024.20240313.70630+ds-5+b1_amd64.deb ... Unpacking libtexlua53-5:amd64 (2024.20240313.70630+ds-5+b1) ... Selecting previously unselected package t1utils. Preparing to unpack .../070-t1utils_1.41-4_amd64.deb ... Unpacking t1utils (1.41-4) ... Selecting previously unselected package libpixman-1-0:amd64. Preparing to unpack .../071-libpixman-1-0_0.44.0-3_amd64.deb ... Unpacking libpixman-1-0:amd64 (0.44.0-3) ... Selecting previously unselected package libxcb-render0:amd64. Preparing to unpack .../072-libxcb-render0_1.17.0-2+b1_amd64.deb ... Unpacking libxcb-render0:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libxcb-shm0:amd64. Preparing to unpack .../073-libxcb-shm0_1.17.0-2+b1_amd64.deb ... Unpacking libxcb-shm0:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libcairo2:amd64. Preparing to unpack .../074-libcairo2_1.18.2-2_amd64.deb ... Unpacking libcairo2:amd64 (1.18.2-2) ... Selecting previously unselected package libgraphite2-3:amd64. Preparing to unpack .../075-libgraphite2-3_1.3.14-2+b1_amd64.deb ... Unpacking libgraphite2-3:amd64 (1.3.14-2+b1) ... Selecting previously unselected package libharfbuzz0b:amd64. Preparing to unpack .../076-libharfbuzz0b_10.2.0-1_amd64.deb ... Unpacking libharfbuzz0b:amd64 (10.2.0-1) ... Selecting previously unselected package libmpfi0:amd64. Preparing to unpack .../077-libmpfi0_1.5.4+ds-4_amd64.deb ... Unpacking libmpfi0:amd64 (1.5.4+ds-4) ... Selecting previously unselected package libpotrace0:amd64. Preparing to unpack .../078-libpotrace0_1.16-2+b2_amd64.deb ... Unpacking libpotrace0:amd64 (1.16-2+b2) ... Selecting previously unselected package libteckit0:amd64. Preparing to unpack .../079-libteckit0_2.5.12+ds1-1+b1_amd64.deb ... Unpacking libteckit0:amd64 (2.5.12+ds1-1+b1) ... Selecting previously unselected package libice6:amd64. Preparing to unpack .../080-libice6_2%3a1.1.1-1_amd64.deb ... Unpacking libice6:amd64 (2:1.1.1-1) ... Selecting previously unselected package libsm6:amd64. Preparing to unpack .../081-libsm6_2%3a1.2.4-1_amd64.deb ... Unpacking libsm6:amd64 (2:1.2.4-1) ... Selecting previously unselected package libxt6t64:amd64. Preparing to unpack .../082-libxt6t64_1%3a1.2.1-1.2+b2_amd64.deb ... Unpacking libxt6t64:amd64 (1:1.2.1-1.2+b2) ... Selecting previously unselected package libxmu6:amd64. Preparing to unpack .../083-libxmu6_2%3a1.1.3-3+b4_amd64.deb ... Unpacking libxmu6:amd64 (2:1.1.3-3+b4) ... Selecting previously unselected package libxpm4:amd64. Preparing to unpack .../084-libxpm4_1%3a3.5.17-1+b3_amd64.deb ... Unpacking libxpm4:amd64 (1:3.5.17-1+b3) ... Selecting previously unselected package libxaw7:amd64. Preparing to unpack .../085-libxaw7_2%3a1.0.16-1_amd64.deb ... Unpacking libxaw7:amd64 (2:1.0.16-1) ... Selecting previously unselected package libxi6:amd64. Preparing to unpack .../086-libxi6_2%3a1.8.2-1_amd64.deb ... Unpacking libxi6:amd64 (2:1.8.2-1) ... Selecting previously unselected package libzzip-0-13t64:amd64. Preparing to unpack .../087-libzzip-0-13t64_0.13.72+dfsg.1-1.3_amd64.deb ... Unpacking libzzip-0-13t64:amd64 (0.13.72+dfsg.1-1.3) ... Selecting previously unselected package texlive-binaries. Preparing to unpack .../088-texlive-binaries_2024.20240313.70630+ds-5+b1_amd64.deb ... Unpacking texlive-binaries (2024.20240313.70630+ds-5+b1) ... Selecting previously unselected package xdg-utils. Preparing to unpack .../089-xdg-utils_1.2.1-2_all.deb ... Unpacking xdg-utils (1.2.1-2) ... Selecting previously unselected package texlive-base. Preparing to unpack .../090-texlive-base_2024.20250114-1_all.deb ... Unpacking texlive-base (2024.20250114-1) ... Selecting previously unselected package fonts-lmodern. Preparing to unpack .../091-fonts-lmodern_2.005-1_all.deb ... Unpacking fonts-lmodern (2.005-1) ... Selecting previously unselected package texlive-latex-base. Preparing to unpack .../092-texlive-latex-base_2024.20250114-1_all.deb ... Unpacking texlive-latex-base (2024.20250114-1) ... Selecting previously unselected package texlive-latex-recommended. Preparing to unpack .../093-texlive-latex-recommended_2024.20250114-1_all.deb ... Unpacking texlive-latex-recommended (2024.20250114-1) ... Selecting previously unselected package cm-super-minimal. Preparing to unpack .../094-cm-super-minimal_0.3.4-17_all.deb ... Unpacking cm-super-minimal (0.3.4-17) ... Selecting previously unselected package dbus-user-session. Preparing to unpack .../095-dbus-user-session_1.16.0-1_amd64.deb ... Unpacking dbus-user-session (1.16.0-1) ... Selecting previously unselected package libdconf1:amd64. Preparing to unpack .../096-libdconf1_0.40.0-5_amd64.deb ... Unpacking libdconf1:amd64 (0.40.0-5) ... Selecting previously unselected package dconf-service. Preparing to unpack .../097-dconf-service_0.40.0-5_amd64.deb ... Unpacking dconf-service (0.40.0-5) ... Selecting previously unselected package dconf-gsettings-backend:amd64. Preparing to unpack .../098-dconf-gsettings-backend_0.40.0-5_amd64.deb ... Unpacking dconf-gsettings-backend:amd64 (0.40.0-5) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../099-libdebhelper-perl_13.24.1_all.deb ... Unpacking libdebhelper-perl (13.24.1) ... Selecting previously unselected package libtool. Preparing to unpack .../100-libtool_2.5.4-2_all.deb ... Unpacking libtool (2.5.4-2) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../101-dh-autoreconf_20_all.deb ... Unpacking dh-autoreconf (20) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../102-libarchive-zip-perl_1.68-1_all.deb ... Unpacking libarchive-zip-perl (1.68-1) ... Selecting previously unselected package libfile-stripnondeterminism-perl. Preparing to unpack .../103-libfile-stripnondeterminism-perl_1.14.1-1_all.deb ... Unpacking libfile-stripnondeterminism-perl (1.14.1-1) ... Selecting previously unselected package dh-strip-nondeterminism. Preparing to unpack .../104-dh-strip-nondeterminism_1.14.1-1_all.deb ... Unpacking dh-strip-nondeterminism (1.14.1-1) ... Selecting previously unselected package libelf1t64:amd64. Preparing to unpack .../105-libelf1t64_0.192-4_amd64.deb ... Unpacking libelf1t64:amd64 (0.192-4) ... Selecting previously unselected package dwz. Preparing to unpack .../106-dwz_0.15-1+b1_amd64.deb ... Unpacking dwz (0.15-1+b1) ... Selecting previously unselected package libunistring5:amd64. Preparing to unpack .../107-libunistring5_1.3-1_amd64.deb ... Unpacking libunistring5:amd64 (1.3-1) ... Selecting previously unselected package gettext. Preparing to unpack .../108-gettext_0.23.1-1_amd64.deb ... Unpacking gettext (0.23.1-1) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../109-intltool-debian_0.35.0+20060710.6_all.deb ... Unpacking intltool-debian (0.35.0+20060710.6) ... Selecting previously unselected package po-debconf. Preparing to unpack .../110-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../111-debhelper_13.24.1_all.deb ... Unpacking debhelper (13.24.1) ... Selecting previously unselected package python3-autocommand. Preparing to unpack .../112-python3-autocommand_2.2.2-3_all.deb ... Unpacking python3-autocommand (2.2.2-3) ... Selecting previously unselected package python3-more-itertools. Preparing to unpack .../113-python3-more-itertools_10.6.0-1_all.deb ... Unpacking python3-more-itertools (10.6.0-1) ... Selecting previously unselected package python3-typing-extensions. Preparing to unpack .../114-python3-typing-extensions_4.12.2-2_all.deb ... Unpacking python3-typing-extensions (4.12.2-2) ... Selecting previously unselected package python3-typeguard. Preparing to unpack .../115-python3-typeguard_4.4.1-1_all.deb ... Unpacking python3-typeguard (4.4.1-1) ... Selecting previously unselected package python3-inflect. Preparing to unpack .../116-python3-inflect_7.3.1-2_all.deb ... Unpacking python3-inflect (7.3.1-2) ... Selecting previously unselected package python3-jaraco.context. Preparing to unpack .../117-python3-jaraco.context_6.0.0-1_all.deb ... Unpacking python3-jaraco.context (6.0.0-1) ... Selecting previously unselected package python3-jaraco.functools. Preparing to unpack .../118-python3-jaraco.functools_4.1.0-1_all.deb ... Unpacking python3-jaraco.functools (4.1.0-1) ... Selecting previously unselected package python3-pkg-resources. Preparing to unpack .../119-python3-pkg-resources_75.6.0-1_all.deb ... Unpacking python3-pkg-resources (75.6.0-1) ... Selecting previously unselected package python3-jaraco.text. Preparing to unpack .../120-python3-jaraco.text_4.0.0-1_all.deb ... Unpacking python3-jaraco.text (4.0.0-1) ... Selecting previously unselected package python3-zipp. Preparing to unpack .../121-python3-zipp_3.21.0-1_all.deb ... Unpacking python3-zipp (3.21.0-1) ... Selecting previously unselected package python3-setuptools. Preparing to unpack .../122-python3-setuptools_75.6.0-1_all.deb ... Unpacking python3-setuptools (75.6.0-1) ... Selecting previously unselected package dh-python. Preparing to unpack .../123-dh-python_6.20250108_all.deb ... Unpacking dh-python (6.20250108) ... Selecting previously unselected package libgpg-error0:amd64. Preparing to unpack .../124-libgpg-error0_1.51-3_amd64.deb ... Unpacking libgpg-error0:amd64 (1.51-3) ... Selecting previously unselected package libassuan9:amd64. Preparing to unpack .../125-libassuan9_3.0.1-2_amd64.deb ... Unpacking libassuan9:amd64 (3.0.1-2) ... Selecting previously unselected package libgcrypt20:amd64. Preparing to unpack .../126-libgcrypt20_1.11.0-7_amd64.deb ... Unpacking libgcrypt20:amd64 (1.11.0-7) ... Selecting previously unselected package gpgconf. Preparing to unpack .../127-gpgconf_2.2.46-1+b1_amd64.deb ... Unpacking gpgconf (2.2.46-1+b1) ... Selecting previously unselected package libidn2-0:amd64. Preparing to unpack .../128-libidn2-0_2.3.7-2+b1_amd64.deb ... Unpacking libidn2-0:amd64 (2.3.7-2+b1) ... Selecting previously unselected package libp11-kit0:amd64. Preparing to unpack .../129-libp11-kit0_0.25.5-3_amd64.deb ... Unpacking libp11-kit0:amd64 (0.25.5-3) ... Selecting previously unselected package libtasn1-6:amd64. Preparing to unpack .../130-libtasn1-6_4.19.0-3+b3_amd64.deb ... Unpacking libtasn1-6:amd64 (4.19.0-3+b3) ... Selecting previously unselected package libgnutls30t64:amd64. Preparing to unpack .../131-libgnutls30t64_3.8.8-2_amd64.deb ... Unpacking libgnutls30t64:amd64 (3.8.8-2) ... Selecting previously unselected package libksba8:amd64. Preparing to unpack .../132-libksba8_1.6.7-2+b1_amd64.deb ... Unpacking libksba8:amd64 (1.6.7-2+b1) ... Selecting previously unselected package libsasl2-modules-db:amd64. Preparing to unpack .../133-libsasl2-modules-db_2.1.28+dfsg1-8+b1_amd64.deb ... Unpacking libsasl2-modules-db:amd64 (2.1.28+dfsg1-8+b1) ... Selecting previously unselected package libsasl2-2:amd64. Preparing to unpack .../134-libsasl2-2_2.1.28+dfsg1-8+b1_amd64.deb ... Unpacking libsasl2-2:amd64 (2.1.28+dfsg1-8+b1) ... Selecting previously unselected package libldap2:amd64. Preparing to unpack .../135-libldap2_2.6.9+dfsg-1_amd64.deb ... Unpacking libldap2:amd64 (2.6.9+dfsg-1) ... Selecting previously unselected package libnpth0t64:amd64. Preparing to unpack .../136-libnpth0t64_1.8-2_amd64.deb ... Unpacking libnpth0t64:amd64 (1.8-2) ... Selecting previously unselected package dirmngr. Preparing to unpack .../137-dirmngr_2.2.46-1+b1_amd64.deb ... Unpacking dirmngr (2.2.46-1+b1) ... Selecting previously unselected package xml-core. Preparing to unpack .../138-xml-core_0.19_all.deb ... Unpacking xml-core (0.19) ... Selecting previously unselected package docutils-common. Preparing to unpack .../139-docutils-common_0.21.2+dfsg-2_all.deb ... Unpacking docutils-common (0.21.2+dfsg-2) ... Selecting previously unselected package fontconfig. Preparing to unpack .../140-fontconfig_2.15.0-2_amd64.deb ... Unpacking fontconfig (2.15.0-2) ... Selecting previously unselected package fonts-font-awesome. Preparing to unpack .../141-fonts-font-awesome_5.0.10+really4.7.0~dfsg-4.1_all.deb ... Unpacking fonts-font-awesome (5.0.10+really4.7.0~dfsg-4.1) ... Selecting previously unselected package fonts-lyx. Preparing to unpack .../142-fonts-lyx_2.4.3-1_all.deb ... Unpacking fonts-lyx (2.4.3-1) ... Selecting previously unselected package fonts-mathjax. Preparing to unpack .../143-fonts-mathjax_2.7.9+dfsg-1_all.deb ... Unpacking fonts-mathjax (2.7.9+dfsg-1) ... Selecting previously unselected package fonts-open-sans. Preparing to unpack .../144-fonts-open-sans_1.11-2_all.deb ... Unpacking fonts-open-sans (1.11-2) ... Selecting previously unselected package gir1.2-glib-2.0:amd64. Preparing to unpack .../145-gir1.2-glib-2.0_2.82.4-2_amd64.deb ... Unpacking gir1.2-glib-2.0:amd64 (2.82.4-2) ... Selecting previously unselected package libatk1.0-0t64:amd64. Preparing to unpack .../146-libatk1.0-0t64_2.55.0.1-1_amd64.deb ... Unpacking libatk1.0-0t64:amd64 (2.55.0.1-1) ... Selecting previously unselected package gir1.2-atk-1.0:amd64. Preparing to unpack .../147-gir1.2-atk-1.0_2.55.0.1-1_amd64.deb ... Unpacking gir1.2-atk-1.0:amd64 (2.55.0.1-1) ... Selecting previously unselected package libcairo-gobject2:amd64. Preparing to unpack .../148-libcairo-gobject2_1.18.2-2_amd64.deb ... Unpacking libcairo-gobject2:amd64 (1.18.2-2) ... Selecting previously unselected package gir1.2-freedesktop:amd64. Preparing to unpack .../149-gir1.2-freedesktop_1.82.0-4_amd64.deb ... Unpacking gir1.2-freedesktop:amd64 (1.82.0-4) ... Selecting previously unselected package gir1.2-gdkpixbuf-2.0:amd64. Preparing to unpack .../150-gir1.2-gdkpixbuf-2.0_2.42.12+dfsg-2_amd64.deb ... Unpacking gir1.2-gdkpixbuf-2.0:amd64 (2.42.12+dfsg-2) ... Selecting previously unselected package libgirepository-1.0-1:amd64. Preparing to unpack .../151-libgirepository-1.0-1_1.82.0-4_amd64.deb ... Unpacking libgirepository-1.0-1:amd64 (1.82.0-4) ... Selecting previously unselected package gir1.2-girepository-2.0:amd64. Preparing to unpack .../152-gir1.2-girepository-2.0_1.82.0-4_amd64.deb ... Unpacking gir1.2-girepository-2.0:amd64 (1.82.0-4) ... Selecting previously unselected package libharfbuzz-gobject0:amd64. Preparing to unpack .../153-libharfbuzz-gobject0_10.2.0-1_amd64.deb ... Unpacking libharfbuzz-gobject0:amd64 (10.2.0-1) ... Selecting previously unselected package gir1.2-harfbuzz-0.0:amd64. Preparing to unpack .../154-gir1.2-harfbuzz-0.0_10.2.0-1_amd64.deb ... Unpacking gir1.2-harfbuzz-0.0:amd64 (10.2.0-1) ... Selecting previously unselected package libfribidi0:amd64. Preparing to unpack .../155-libfribidi0_1.0.16-1_amd64.deb ... Unpacking libfribidi0:amd64 (1.0.16-1) ... Selecting previously unselected package libthai-data. Preparing to unpack .../156-libthai-data_0.1.29-2_all.deb ... Unpacking libthai-data (0.1.29-2) ... Selecting previously unselected package libdatrie1:amd64. Preparing to unpack .../157-libdatrie1_0.2.13-3+b1_amd64.deb ... Unpacking libdatrie1:amd64 (0.2.13-3+b1) ... Selecting previously unselected package libthai0:amd64. Preparing to unpack .../158-libthai0_0.1.29-2+b1_amd64.deb ... Unpacking libthai0:amd64 (0.1.29-2+b1) ... Selecting previously unselected package libpango-1.0-0:amd64. Preparing to unpack .../159-libpango-1.0-0_1.56.1-1_amd64.deb ... Unpacking libpango-1.0-0:amd64 (1.56.1-1) ... Selecting previously unselected package libpangoft2-1.0-0:amd64. Preparing to unpack .../160-libpangoft2-1.0-0_1.56.1-1_amd64.deb ... Unpacking libpangoft2-1.0-0:amd64 (1.56.1-1) ... Selecting previously unselected package libpangocairo-1.0-0:amd64. Preparing to unpack .../161-libpangocairo-1.0-0_1.56.1-1_amd64.deb ... Unpacking libpangocairo-1.0-0:amd64 (1.56.1-1) ... Selecting previously unselected package libpangoxft-1.0-0:amd64. Preparing to unpack .../162-libpangoxft-1.0-0_1.56.1-1_amd64.deb ... Unpacking libpangoxft-1.0-0:amd64 (1.56.1-1) ... Selecting previously unselected package gir1.2-pango-1.0:amd64. Preparing to unpack .../163-gir1.2-pango-1.0_1.56.1-1_amd64.deb ... Unpacking gir1.2-pango-1.0:amd64 (1.56.1-1) ... Selecting previously unselected package libatspi2.0-0t64:amd64. Preparing to unpack .../164-libatspi2.0-0t64_2.55.0.1-1_amd64.deb ... Unpacking libatspi2.0-0t64:amd64 (2.55.0.1-1) ... Selecting previously unselected package libatk-bridge2.0-0t64:amd64. Preparing to unpack .../165-libatk-bridge2.0-0t64_2.55.0.1-1_amd64.deb ... Unpacking libatk-bridge2.0-0t64:amd64 (2.55.0.1-1) ... Selecting previously unselected package libcloudproviders0:amd64. Preparing to unpack .../166-libcloudproviders0_0.3.6-1+b1_amd64.deb ... Unpacking libcloudproviders0:amd64 (0.3.6-1+b1) ... Selecting previously unselected package liblcms2-2:amd64. Preparing to unpack .../167-liblcms2-2_2.16-2_amd64.deb ... Unpacking liblcms2-2:amd64 (2.16-2) ... Selecting previously unselected package libcolord2:amd64. Preparing to unpack .../168-libcolord2_1.4.7-1+b2_amd64.deb ... Unpacking libcolord2:amd64 (1.4.7-1+b2) ... Selecting previously unselected package libavahi-common-data:amd64. Preparing to unpack .../169-libavahi-common-data_0.8-16_amd64.deb ... Unpacking libavahi-common-data:amd64 (0.8-16) ... Selecting previously unselected package libavahi-common3:amd64. Preparing to unpack .../170-libavahi-common3_0.8-16_amd64.deb ... Unpacking libavahi-common3:amd64 (0.8-16) ... Selecting previously unselected package libavahi-client3:amd64. Preparing to unpack .../171-libavahi-client3_0.8-16_amd64.deb ... Unpacking libavahi-client3:amd64 (0.8-16) ... Selecting previously unselected package libkrb5support0:amd64. Preparing to unpack .../172-libkrb5support0_1.21.3-4_amd64.deb ... Unpacking libkrb5support0:amd64 (1.21.3-4) ... Selecting previously unselected package libcom-err2:amd64. Preparing to unpack .../173-libcom-err2_1.47.2-1_amd64.deb ... Unpacking libcom-err2:amd64 (1.47.2-1) ... Selecting previously unselected package libk5crypto3:amd64. Preparing to unpack .../174-libk5crypto3_1.21.3-4_amd64.deb ... Unpacking libk5crypto3:amd64 (1.21.3-4) ... Selecting previously unselected package libkeyutils1:amd64. Preparing to unpack .../175-libkeyutils1_1.6.3-4_amd64.deb ... Unpacking libkeyutils1:amd64 (1.6.3-4) ... Selecting previously unselected package libkrb5-3:amd64. Preparing to unpack .../176-libkrb5-3_1.21.3-4_amd64.deb ... Unpacking libkrb5-3:amd64 (1.21.3-4) ... Selecting previously unselected package libgssapi-krb5-2:amd64. Preparing to unpack .../177-libgssapi-krb5-2_1.21.3-4_amd64.deb ... Unpacking libgssapi-krb5-2:amd64 (1.21.3-4) ... Selecting previously unselected package libcups2t64:amd64. Preparing to unpack .../178-libcups2t64_2.4.10-2+b1_amd64.deb ... Unpacking libcups2t64:amd64 (2.4.10-2+b1) ... Selecting previously unselected package libepoxy0:amd64. Preparing to unpack .../179-libepoxy0_1.5.10-2_amd64.deb ... Unpacking libepoxy0:amd64 (1.5.10-2) ... Selecting previously unselected package libwayland-client0:amd64. Preparing to unpack .../180-libwayland-client0_1.23.0-1+b1_amd64.deb ... Unpacking libwayland-client0:amd64 (1.23.0-1+b1) ... Selecting previously unselected package libwayland-cursor0:amd64. Preparing to unpack .../181-libwayland-cursor0_1.23.0-1+b1_amd64.deb ... Unpacking libwayland-cursor0:amd64 (1.23.0-1+b1) ... Selecting previously unselected package libwayland-egl1:amd64. Preparing to unpack .../182-libwayland-egl1_1.23.0-1+b1_amd64.deb ... Unpacking libwayland-egl1:amd64 (1.23.0-1+b1) ... Selecting previously unselected package libxcomposite1:amd64. Preparing to unpack .../183-libxcomposite1_1%3a0.4.6-1_amd64.deb ... Unpacking libxcomposite1:amd64 (1:0.4.6-1) ... Selecting previously unselected package libxfixes3:amd64. Preparing to unpack .../184-libxfixes3_1%3a6.0.0-2+b3_amd64.deb ... Unpacking libxfixes3:amd64 (1:6.0.0-2+b3) ... Selecting previously unselected package libxcursor1:amd64. Preparing to unpack .../185-libxcursor1_1%3a1.2.3-1_amd64.deb ... Unpacking libxcursor1:amd64 (1:1.2.3-1) ... Selecting previously unselected package libxdamage1:amd64. Preparing to unpack .../186-libxdamage1_1%3a1.1.6-1+b2_amd64.deb ... Unpacking libxdamage1:amd64 (1:1.1.6-1+b2) ... Selecting previously unselected package libxinerama1:amd64. Preparing to unpack .../187-libxinerama1_2%3a1.1.4-3+b3_amd64.deb ... Unpacking libxinerama1:amd64 (2:1.1.4-3+b3) ... Selecting previously unselected package xkb-data. Preparing to unpack .../188-xkb-data_2.42-1_all.deb ... Unpacking xkb-data (2.42-1) ... Selecting previously unselected package libxkbcommon0:amd64. Preparing to unpack .../189-libxkbcommon0_1.7.0-2_amd64.deb ... Unpacking libxkbcommon0:amd64 (1.7.0-2) ... Selecting previously unselected package libxrandr2:amd64. Preparing to unpack .../190-libxrandr2_2%3a1.5.4-1+b2_amd64.deb ... Unpacking libxrandr2:amd64 (2:1.5.4-1+b2) ... Selecting previously unselected package libgtk-3-common. Preparing to unpack .../191-libgtk-3-common_3.24.43-5_all.deb ... Unpacking libgtk-3-common (3.24.43-5) ... Selecting previously unselected package libgtk-3-0t64:amd64. Preparing to unpack .../192-libgtk-3-0t64_3.24.43-5_amd64.deb ... Unpacking libgtk-3-0t64:amd64 (3.24.43-5) ... Selecting previously unselected package gir1.2-gtk-3.0:amd64. Preparing to unpack .../193-gir1.2-gtk-3.0_3.24.43-5_amd64.deb ... Unpacking gir1.2-gtk-3.0:amd64 (3.24.43-5) ... Selecting previously unselected package native-architecture. Preparing to unpack .../194-native-architecture_0.2.3_all.deb ... Unpacking native-architecture (0.2.3) ... Selecting previously unselected package libgirepository-2.0-0:amd64. Preparing to unpack .../195-libgirepository-2.0-0_2.82.4-2_amd64.deb ... Unpacking libgirepository-2.0-0:amd64 (2.82.4-2) ... Selecting previously unselected package girepository-tools:amd64. Preparing to unpack .../196-girepository-tools_2.82.4-2_amd64.deb ... Unpacking girepository-tools:amd64 (2.82.4-2) ... Selecting previously unselected package gnupg-l10n. Preparing to unpack .../197-gnupg-l10n_2.2.46-1_all.deb ... Unpacking gnupg-l10n (2.2.46-1) ... Selecting previously unselected package gpg. Preparing to unpack .../198-gpg_2.2.46-1+b1_amd64.deb ... Unpacking gpg (2.2.46-1+b1) ... Selecting previously unselected package pinentry-curses. Preparing to unpack .../199-pinentry-curses_1.3.1-2_amd64.deb ... Unpacking pinentry-curses (1.3.1-2) ... Selecting previously unselected package gpg-agent. Preparing to unpack .../200-gpg-agent_2.2.46-1+b1_amd64.deb ... Unpacking gpg-agent (2.2.46-1+b1) ... Selecting previously unselected package gpgsm. Preparing to unpack .../201-gpgsm_2.2.46-1+b1_amd64.deb ... Unpacking gpgsm (2.2.46-1+b1) ... Selecting previously unselected package gnupg. Preparing to unpack .../202-gnupg_2.2.46-1_all.deb ... Unpacking gnupg (2.2.46-1) ... Selecting previously unselected package icu-devtools. Preparing to unpack .../203-icu-devtools_72.1-6_amd64.deb ... Unpacking icu-devtools (72.1-6) ... Selecting previously unselected package latexmk. Preparing to unpack .../204-latexmk_1%3a4.86~ds-1_all.deb ... Unpacking latexmk (1:4.86~ds-1) ... Selecting previously unselected package libapache-pom-java. Preparing to unpack .../205-libapache-pom-java_33-2_all.deb ... Unpacking libapache-pom-java (33-2) ... Selecting previously unselected package libblas3:amd64. Preparing to unpack .../206-libblas3_3.12.0-4_amd64.deb ... Unpacking libblas3:amd64 (3.12.0-4) ... Selecting previously unselected package uuid-dev:amd64. Preparing to unpack .../207-uuid-dev_2.40.4-1_amd64.deb ... Unpacking uuid-dev:amd64 (2.40.4-1) ... Selecting previously unselected package libblkid-dev:amd64. Preparing to unpack .../208-libblkid-dev_2.40.4-1_amd64.deb ... Unpacking libblkid-dev:amd64 (2.40.4-1) ... Selecting previously unselected package libboost1.83-dev:amd64. Preparing to unpack .../209-libboost1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-atomic1.83.0:amd64. Preparing to unpack .../210-libboost-atomic1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-atomic1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-atomic1.83-dev:amd64. Preparing to unpack .../211-libboost-atomic1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-atomic1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-chrono1.83.0t64:amd64. Preparing to unpack .../212-libboost-chrono1.83.0t64_1.83.0-4_amd64.deb ... Unpacking libboost-chrono1.83.0t64:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-chrono1.83-dev:amd64. Preparing to unpack .../213-libboost-chrono1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-chrono1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-date-time1.83.0:amd64. Preparing to unpack .../214-libboost-date-time1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-date-time1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-serialization1.83.0:amd64. Preparing to unpack .../215-libboost-serialization1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-serialization1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-serialization1.83-dev:amd64. Preparing to unpack .../216-libboost-serialization1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-serialization1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-date-time1.83-dev:amd64. Preparing to unpack .../217-libboost-date-time1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-date-time1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-system1.83.0:amd64. Preparing to unpack .../218-libboost-system1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-system1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-system1.83-dev:amd64. Preparing to unpack .../219-libboost-system1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-system1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-thread1.83.0:amd64. Preparing to unpack .../220-libboost-thread1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-thread1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-thread1.83-dev:amd64. Preparing to unpack .../221-libboost-thread1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-thread1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-context1.83.0:amd64. Preparing to unpack .../222-libboost-context1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-context1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-context1.83-dev:amd64. Preparing to unpack .../223-libboost-context1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-context1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-coroutine1.83.0:amd64. Preparing to unpack .../224-libboost-coroutine1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-coroutine1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-coroutine1.83-dev:amd64. Preparing to unpack .../225-libboost-coroutine1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-coroutine1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-coroutine-dev:amd64. Preparing to unpack .../226-libboost-coroutine-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-coroutine-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libboost-dev:amd64. Preparing to unpack .../227-libboost-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libboost-graph1.83.0:amd64. Preparing to unpack .../228-libboost-graph1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-graph1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-regex1.83.0:amd64. Preparing to unpack .../229-libboost-regex1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-regex1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libicu-dev:amd64. Preparing to unpack .../230-libicu-dev_72.1-6_amd64.deb ... Unpacking libicu-dev:amd64 (72.1-6) ... Selecting previously unselected package libboost-regex1.83-dev:amd64. Preparing to unpack .../231-libboost-regex1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-regex1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-test1.83.0:amd64. Preparing to unpack .../232-libboost-test1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-test1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-test1.83-dev:amd64. Preparing to unpack .../233-libboost-test1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-test1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-graph1.83-dev:amd64. Preparing to unpack .../234-libboost-graph1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-graph1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-graph-dev:amd64. Preparing to unpack .../235-libboost-graph-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-graph-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libboost-iostreams1.83-dev:amd64. Preparing to unpack .../236-libboost-iostreams1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-iostreams1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-iostreams-dev:amd64. Preparing to unpack .../237-libboost-iostreams-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-iostreams-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libboost-program-options1.83.0:amd64. Preparing to unpack .../238-libboost-program-options1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-program-options1.83.0:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-program-options1.83-dev:amd64. Preparing to unpack .../239-libboost-program-options1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-program-options1.83-dev:amd64 (1.83.0-4) ... Selecting previously unselected package libboost-program-options-dev:amd64. Preparing to unpack .../240-libboost-program-options-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-program-options-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libboost-python1.83.0. Preparing to unpack .../241-libboost-python1.83.0_1.83.0-4_amd64.deb ... Unpacking libboost-python1.83.0 (1.83.0-4) ... Selecting previously unselected package libpython3.13:amd64. Preparing to unpack .../242-libpython3.13_3.13.1-3_amd64.deb ... Unpacking libpython3.13:amd64 (3.13.1-3) ... Selecting previously unselected package libexpat1-dev:amd64. Preparing to unpack .../243-libexpat1-dev_2.6.4-1_amd64.deb ... Unpacking libexpat1-dev:amd64 (2.6.4-1) ... Selecting previously unselected package zlib1g-dev:amd64. Preparing to unpack .../244-zlib1g-dev_1%3a1.3.dfsg+really1.3.1-1+b1_amd64.deb ... Unpacking zlib1g-dev:amd64 (1:1.3.dfsg+really1.3.1-1+b1) ... Selecting previously unselected package libpython3.13-dev:amd64. Preparing to unpack .../245-libpython3.13-dev_3.13.1-3_amd64.deb ... Unpacking libpython3.13-dev:amd64 (3.13.1-3) ... Selecting previously unselected package libpython3-dev:amd64. Preparing to unpack .../246-libpython3-dev_3.13.1-2_amd64.deb ... Unpacking libpython3-dev:amd64 (3.13.1-2) ... Selecting previously unselected package python3.13-dev. Preparing to unpack .../247-python3.13-dev_3.13.1-3_amd64.deb ... Unpacking python3.13-dev (3.13.1-3) ... Selecting previously unselected package libjs-jquery. Preparing to unpack .../248-libjs-jquery_3.6.1+dfsg+~3.5.14-1_all.deb ... Unpacking libjs-jquery (3.6.1+dfsg+~3.5.14-1) ... Selecting previously unselected package libjs-underscore. Preparing to unpack .../249-libjs-underscore_1.13.4~dfsg+~1.11.4-3_all.deb ... Unpacking libjs-underscore (1.13.4~dfsg+~1.11.4-3) ... Selecting previously unselected package libjs-sphinxdoc. Preparing to unpack .../250-libjs-sphinxdoc_8.1.3-4_all.deb ... Unpacking libjs-sphinxdoc (8.1.3-4) ... Selecting previously unselected package python3-dev. Preparing to unpack .../251-python3-dev_3.13.1-2_amd64.deb ... Unpacking python3-dev (3.13.1-2) ... Selecting previously unselected package libboost-python1.83-dev. Preparing to unpack .../252-libboost-python1.83-dev_1.83.0-4_amd64.deb ... Unpacking libboost-python1.83-dev (1.83.0-4) ... Selecting previously unselected package libboost-python-dev. Preparing to unpack .../253-libboost-python-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-python-dev (1.83.0.2+b2) ... Selecting previously unselected package libboost-regex-dev:amd64. Preparing to unpack .../254-libboost-regex-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-regex-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libboost-system-dev:amd64. Preparing to unpack .../255-libboost-system-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-system-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libboost-thread-dev:amd64. Preparing to unpack .../256-libboost-thread-dev_1.83.0.2+b2_amd64.deb ... Unpacking libboost-thread-dev:amd64 (1.83.0.2+b2) ... Selecting previously unselected package libbrotli-dev:amd64. Preparing to unpack .../257-libbrotli-dev_1.1.0-2+b6_amd64.deb ... Unpacking libbrotli-dev:amd64 (1.1.0-2+b6) ... Selecting previously unselected package libbz2-dev:amd64. Preparing to unpack .../258-libbz2-dev_1.0.8-6_amd64.deb ... Unpacking libbz2-dev:amd64 (1.0.8-6) ... Selecting previously unselected package liblzo2-2:amd64. Preparing to unpack .../259-liblzo2-2_2.10-3+b1_amd64.deb ... Unpacking liblzo2-2:amd64 (2.10-3+b1) ... Selecting previously unselected package libcairo-script-interpreter2:amd64. Preparing to unpack .../260-libcairo-script-interpreter2_1.18.2-2_amd64.deb ... Unpacking libcairo-script-interpreter2:amd64 (1.18.2-2) ... Selecting previously unselected package libpng-dev:amd64. Preparing to unpack .../261-libpng-dev_1.6.45-1_amd64.deb ... Unpacking libpng-dev:amd64 (1.6.45-1) ... Selecting previously unselected package libfreetype-dev:amd64. Preparing to unpack .../262-libfreetype-dev_2.13.3+dfsg-1_amd64.deb ... Unpacking libfreetype-dev:amd64 (2.13.3+dfsg-1) ... Selecting previously unselected package libpkgconf3:amd64. Preparing to unpack .../263-libpkgconf3_1.8.1-4_amd64.deb ... Unpacking libpkgconf3:amd64 (1.8.1-4) ... Selecting previously unselected package pkgconf-bin. Preparing to unpack .../264-pkgconf-bin_1.8.1-4_amd64.deb ... Unpacking pkgconf-bin (1.8.1-4) ... Selecting previously unselected package pkgconf:amd64. Preparing to unpack .../265-pkgconf_1.8.1-4_amd64.deb ... Unpacking pkgconf:amd64 (1.8.1-4) ... Selecting previously unselected package libfontconfig-dev:amd64. Preparing to unpack .../266-libfontconfig-dev_2.15.0-2_amd64.deb ... Unpacking libfontconfig-dev:amd64 (2.15.0-2) ... Selecting previously unselected package libffi-dev:amd64. Preparing to unpack .../267-libffi-dev_3.4.6-1_amd64.deb ... Unpacking libffi-dev:amd64 (3.4.6-1) ... Selecting previously unselected package libsepol-dev:amd64. Preparing to unpack .../268-libsepol-dev_3.7-1_amd64.deb ... Unpacking libsepol-dev:amd64 (3.7-1) ... Selecting previously unselected package libpcre2-16-0:amd64. Preparing to unpack .../269-libpcre2-16-0_10.44-5_amd64.deb ... Unpacking libpcre2-16-0:amd64 (10.44-5) ... Selecting previously unselected package libpcre2-32-0:amd64. Preparing to unpack .../270-libpcre2-32-0_10.44-5_amd64.deb ... Unpacking libpcre2-32-0:amd64 (10.44-5) ... Selecting previously unselected package libpcre2-posix3:amd64. Preparing to unpack .../271-libpcre2-posix3_10.44-5_amd64.deb ... Unpacking libpcre2-posix3:amd64 (10.44-5) ... Selecting previously unselected package libpcre2-dev:amd64. Preparing to unpack .../272-libpcre2-dev_10.44-5_amd64.deb ... Unpacking libpcre2-dev:amd64 (10.44-5) ... Selecting previously unselected package libselinux1-dev:amd64. Preparing to unpack .../273-libselinux1-dev_3.7-3+b1_amd64.deb ... Unpacking libselinux1-dev:amd64 (3.7-3+b1) ... Selecting previously unselected package libmount-dev:amd64. Preparing to unpack .../274-libmount-dev_2.40.4-1_amd64.deb ... Unpacking libmount-dev:amd64 (2.40.4-1) ... Selecting previously unselected package libsysprof-capture-4-dev:amd64. Preparing to unpack .../275-libsysprof-capture-4-dev_47.2-1_amd64.deb ... Unpacking libsysprof-capture-4-dev:amd64 (47.2-1) ... Selecting previously unselected package libgio-2.0-dev:amd64. Preparing to unpack .../276-libgio-2.0-dev_2.82.4-2_amd64.deb ... Unpacking libgio-2.0-dev:amd64 (2.82.4-2) ... Selecting previously unselected package libglib2.0-data. Preparing to unpack .../277-libglib2.0-data_2.82.4-2_all.deb ... Unpacking libglib2.0-data (2.82.4-2) ... Selecting previously unselected package libglib2.0-bin. Preparing to unpack .../278-libglib2.0-bin_2.82.4-2_amd64.deb ... Unpacking libglib2.0-bin (2.82.4-2) ... Selecting previously unselected package python3-packaging. Preparing to unpack .../279-python3-packaging_24.2-1_all.deb ... Unpacking python3-packaging (24.2-1) ... Selecting previously unselected package libgio-2.0-dev-bin. Preparing to unpack .../280-libgio-2.0-dev-bin_2.82.4-2_amd64.deb ... Unpacking libgio-2.0-dev-bin (2.82.4-2) ... Selecting previously unselected package libglib2.0-dev-bin. Preparing to unpack .../281-libglib2.0-dev-bin_2.82.4-2_amd64.deb ... Unpacking libglib2.0-dev-bin (2.82.4-2) ... Selecting previously unselected package libglib2.0-dev:amd64. Preparing to unpack .../282-libglib2.0-dev_2.82.4-2_amd64.deb ... Unpacking libglib2.0-dev:amd64 (2.82.4-2) ... Selecting previously unselected package libpixman-1-dev:amd64. Preparing to unpack .../283-libpixman-1-dev_0.44.0-3_amd64.deb ... Unpacking libpixman-1-dev:amd64 (0.44.0-3) ... Selecting previously unselected package xorg-sgml-doctools. Preparing to unpack .../284-xorg-sgml-doctools_1%3a1.11-1.1_all.deb ... Unpacking xorg-sgml-doctools (1:1.11-1.1) ... Selecting previously unselected package x11proto-dev. Preparing to unpack .../285-x11proto-dev_2024.1-1_all.deb ... Unpacking x11proto-dev (2024.1-1) ... Selecting previously unselected package x11proto-core-dev. Preparing to unpack .../286-x11proto-core-dev_2024.1-1_all.deb ... Unpacking x11proto-core-dev (2024.1-1) ... Selecting previously unselected package libice-dev:amd64. Preparing to unpack .../287-libice-dev_2%3a1.1.1-1_amd64.deb ... Unpacking libice-dev:amd64 (2:1.1.1-1) ... Selecting previously unselected package libsm-dev:amd64. Preparing to unpack .../288-libsm-dev_2%3a1.2.4-1_amd64.deb ... Unpacking libsm-dev:amd64 (2:1.2.4-1) ... Selecting previously unselected package libxau-dev:amd64. Preparing to unpack .../289-libxau-dev_1%3a1.0.11-1_amd64.deb ... Unpacking libxau-dev:amd64 (1:1.0.11-1) ... Selecting previously unselected package libxdmcp-dev:amd64. Preparing to unpack .../290-libxdmcp-dev_1%3a1.1.5-1_amd64.deb ... Unpacking libxdmcp-dev:amd64 (1:1.1.5-1) ... Selecting previously unselected package xtrans-dev. Preparing to unpack .../291-xtrans-dev_1.4.0-1_all.deb ... Unpacking xtrans-dev (1.4.0-1) ... Selecting previously unselected package libxcb1-dev:amd64. Preparing to unpack .../292-libxcb1-dev_1.17.0-2+b1_amd64.deb ... Unpacking libxcb1-dev:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libx11-dev:amd64. Preparing to unpack .../293-libx11-dev_2%3a1.8.10-2_amd64.deb ... Unpacking libx11-dev:amd64 (2:1.8.10-2) ... Selecting previously unselected package libxcb-render0-dev:amd64. Preparing to unpack .../294-libxcb-render0-dev_1.17.0-2+b1_amd64.deb ... Unpacking libxcb-render0-dev:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libxcb-shm0-dev:amd64. Preparing to unpack .../295-libxcb-shm0-dev_1.17.0-2+b1_amd64.deb ... Unpacking libxcb-shm0-dev:amd64 (1.17.0-2+b1) ... Selecting previously unselected package libxext-dev:amd64. Preparing to unpack .../296-libxext-dev_2%3a1.3.4-1+b3_amd64.deb ... Unpacking libxext-dev:amd64 (2:1.3.4-1+b3) ... Selecting previously unselected package libxrender-dev:amd64. Preparing to unpack .../297-libxrender-dev_1%3a0.9.10-1.1+b3_amd64.deb ... Unpacking libxrender-dev:amd64 (1:0.9.10-1.1+b3) ... Selecting previously unselected package libcairo2-dev:amd64. Preparing to unpack .../298-libcairo2-dev_1.18.2-2_amd64.deb ... Unpacking libcairo2-dev:amd64 (1.18.2-2) ... Selecting previously unselected package libcairomm-1.0-1v5:amd64. Preparing to unpack .../299-libcairomm-1.0-1v5_1.14.5-2+b1_amd64.deb ... Unpacking libcairomm-1.0-1v5:amd64 (1.14.5-2+b1) ... Selecting previously unselected package libsigc++-2.0-dev:amd64. Preparing to unpack .../300-libsigc++-2.0-dev_2.12.1-3_amd64.deb ... Unpacking libsigc++-2.0-dev:amd64 (2.12.1-3) ... Selecting previously unselected package libcairomm-1.0-dev:amd64. Preparing to unpack .../301-libcairomm-1.0-dev_1.14.5-2+b1_amd64.deb ... Unpacking libcairomm-1.0-dev:amd64 (1.14.5-2+b1) ... Selecting previously unselected package libgmpxx4ldbl:amd64. Preparing to unpack .../302-libgmpxx4ldbl_2%3a6.3.0+dfsg-3_amd64.deb ... Unpacking libgmpxx4ldbl:amd64 (2:6.3.0+dfsg-3) ... Selecting previously unselected package libgmp-dev:amd64. Preparing to unpack .../303-libgmp-dev_2%3a6.3.0+dfsg-3_amd64.deb ... Unpacking libgmp-dev:amd64 (2:6.3.0+dfsg-3) ... Selecting previously unselected package libmpfr-dev:amd64. Preparing to unpack .../304-libmpfr-dev_4.2.1-1+b2_amd64.deb ... Unpacking libmpfr-dev:amd64 (4.2.1-1+b2) ... Selecting previously unselected package libcgal-dev:amd64. Preparing to unpack .../305-libcgal-dev_6.0.1-1_amd64.deb ... Unpacking libcgal-dev:amd64 (6.0.1-1) ... Selecting previously unselected package libcommons-parent-java. Preparing to unpack .../306-libcommons-parent-java_56-1_all.deb ... Unpacking libcommons-parent-java (56-1) ... Selecting previously unselected package libcommons-logging-java. Preparing to unpack .../307-libcommons-logging-java_1.3.0-1_all.deb ... Unpacking libcommons-logging-java (1.3.0-1) ... Selecting previously unselected package libnghttp2-14:amd64. Preparing to unpack .../308-libnghttp2-14_1.64.0-1_amd64.deb ... Unpacking libnghttp2-14:amd64 (1.64.0-1) ... Selecting previously unselected package libnghttp3-9:amd64. Preparing to unpack .../309-libnghttp3-9_1.6.0-2_amd64.deb ... Unpacking libnghttp3-9:amd64 (1.6.0-2) ... Selecting previously unselected package libngtcp2-16:amd64. Preparing to unpack .../310-libngtcp2-16_1.9.1-1_amd64.deb ... Unpacking libngtcp2-16:amd64 (1.9.1-1) ... Selecting previously unselected package libngtcp2-crypto-gnutls8:amd64. Preparing to unpack .../311-libngtcp2-crypto-gnutls8_1.9.1-1_amd64.deb ... Unpacking libngtcp2-crypto-gnutls8:amd64 (1.9.1-1) ... Selecting previously unselected package libpsl5t64:amd64. Preparing to unpack .../312-libpsl5t64_0.21.2-1.1+b1_amd64.deb ... Unpacking libpsl5t64:amd64 (0.21.2-1.1+b1) ... Selecting previously unselected package librtmp1:amd64. Preparing to unpack .../313-librtmp1_2.4+20151223.gitfa8646d.1-2+b5_amd64.deb ... Unpacking librtmp1:amd64 (2.4+20151223.gitfa8646d.1-2+b5) ... Selecting previously unselected package libssh2-1t64:amd64. Preparing to unpack .../314-libssh2-1t64_1.11.1-1_amd64.deb ... Unpacking libssh2-1t64:amd64 (1.11.1-1) ... Selecting previously unselected package libcurl3t64-gnutls:amd64. Preparing to unpack .../315-libcurl3t64-gnutls_8.11.1-1+b1_amd64.deb ... Unpacking libcurl3t64-gnutls:amd64 (8.11.1-1+b1) ... Selecting previously unselected package libdav1d7:amd64. Preparing to unpack .../316-libdav1d7_1.5.0-1+b1_amd64.deb ... Unpacking libdav1d7:amd64 (1.5.0-1+b1) ... Selecting previously unselected package libfontbox-java. Preparing to unpack .../317-libfontbox-java_1%3a1.8.16-5_all.deb ... Unpacking libfontbox-java (1:1.8.16-5) ... Selecting previously unselected package libgfortran5:amd64. Preparing to unpack .../318-libgfortran5_14.2.0-14_amd64.deb ... Unpacking libgfortran5:amd64 (14.2.0-14) ... Selecting previously unselected package libgpgme11t64:amd64. Preparing to unpack .../319-libgpgme11t64_1.24.1-2_amd64.deb ... Unpacking libgpgme11t64:amd64 (1.24.1-2) ... Selecting previously unselected package libgpgmepp6t64:amd64. Preparing to unpack .../320-libgpgmepp6t64_1.24.1-2_amd64.deb ... Unpacking libgpgmepp6t64:amd64 (1.24.1-2) ... Selecting previously unselected package libimagequant0:amd64. Preparing to unpack .../321-libimagequant0_2.18.0-1+b2_amd64.deb ... Unpacking libimagequant0:amd64 (2.18.0-1+b2) ... Selecting previously unselected package libjs-jquery-ui. Preparing to unpack .../322-libjs-jquery-ui_1.13.2+dfsg-1_all.deb ... Unpacking libjs-jquery-ui (1.13.2+dfsg-1) ... Selecting previously unselected package libjs-mathjax. Preparing to unpack .../323-libjs-mathjax_2.7.9+dfsg-1_all.deb ... Unpacking libjs-mathjax (2.7.9+dfsg-1) ... Selecting previously unselected package libjson-perl. Preparing to unpack .../324-libjson-perl_4.10000-1_all.deb ... Unpacking libjson-perl (4.10000-1) ... Selecting previously unselected package liblapack3:amd64. Preparing to unpack .../325-liblapack3_3.12.0-4_amd64.deb ... Unpacking liblapack3:amd64 (3.12.0-4) ... Selecting previously unselected package liblbfgsb0:amd64. Preparing to unpack .../326-liblbfgsb0_3.0+dfsg.4-1+b2_amd64.deb ... Unpacking liblbfgsb0:amd64 (3.0+dfsg.4-1+b2) ... Selecting previously unselected package libnspr4:amd64. Preparing to unpack .../327-libnspr4_2%3a4.36-1_amd64.deb ... Unpacking libnspr4:amd64 (2:4.36-1) ... Selecting previously unselected package libnss3:amd64. Preparing to unpack .../328-libnss3_2%3a3.107-1_amd64.deb ... Unpacking libnss3:amd64 (2:3.107-1) ... Selecting previously unselected package libopenjp2-7:amd64. Preparing to unpack .../329-libopenjp2-7_2.5.0-2+b4_amd64.deb ... Unpacking libopenjp2-7:amd64 (2.5.0-2+b4) ... Selecting previously unselected package libpdfbox-java. Preparing to unpack .../330-libpdfbox-java_1%3a1.8.16-5_all.deb ... Unpacking libpdfbox-java (1:1.8.16-5) ... Selecting previously unselected package libpoppler140:amd64. Preparing to unpack .../331-libpoppler140_24.08.0-4_amd64.deb ... Unpacking libpoppler140:amd64 (24.08.0-4) ... Selecting previously unselected package libqhull-r8.0:amd64. Preparing to unpack .../332-libqhull-r8.0_2020.2-6+b2_amd64.deb ... Unpacking libqhull-r8.0:amd64 (2020.2-6+b2) ... Selecting previously unselected package libraqm0:amd64. Preparing to unpack .../333-libraqm0_0.10.2-1_amd64.deb ... Unpacking libraqm0:amd64 (0.10.2-1) ... Selecting previously unselected package librsvg2-2:amd64. Preparing to unpack .../334-librsvg2-2_2.59.2+dfsg-1_amd64.deb ... Unpacking librsvg2-2:amd64 (2.59.2+dfsg-1) ... Selecting previously unselected package librsvg2-common:amd64. Preparing to unpack .../335-librsvg2-common_2.59.2+dfsg-1_amd64.deb ... Unpacking librsvg2-common:amd64 (2.59.2+dfsg-1) ... Selecting previously unselected package libsparsehash-dev. Preparing to unpack .../336-libsparsehash-dev_2.0.3-2_all.deb ... Unpacking libsparsehash-dev (2.0.3-2) ... Selecting previously unselected package libvpx9:amd64. Preparing to unpack .../337-libvpx9_1.15.0-1_amd64.deb ... Unpacking libvpx9:amd64 (1.15.0-1) ... Selecting previously unselected package libwebpdemux2:amd64. Preparing to unpack .../338-libwebpdemux2_1.5.0-0.1_amd64.deb ... Unpacking libwebpdemux2:amd64 (1.5.0-0.1) ... Selecting previously unselected package libwebpmux3:amd64. Preparing to unpack .../339-libwebpmux3_1.5.0-0.1_amd64.deb ... Unpacking libwebpmux3:amd64 (1.5.0-0.1) ... Selecting previously unselected package libxslt1.1:amd64. Preparing to unpack .../340-libxslt1.1_1.1.35-1.1+b1_amd64.deb ... Unpacking libxslt1.1:amd64 (1.1.35-1.1+b1) ... Selecting previously unselected package poppler-utils. Preparing to unpack .../341-poppler-utils_24.08.0-4_amd64.deb ... Unpacking poppler-utils (24.08.0-4) ... Selecting previously unselected package preview-latex-style. Preparing to unpack .../342-preview-latex-style_13.2-1_all.deb ... Unpacking preview-latex-style (13.2-1) ... Selecting previously unselected package python-babel-localedata. Preparing to unpack .../343-python-babel-localedata_2.16.0-1_all.deb ... Unpacking python-babel-localedata (2.16.0-1) ... Selecting previously unselected package sphinx-rtd-theme-common. Preparing to unpack .../344-sphinx-rtd-theme-common_3.0.2+dfsg-2_all.deb ... Unpacking sphinx-rtd-theme-common (3.0.2+dfsg-2) ... Selecting previously unselected package python-ipython-doc. Preparing to unpack .../345-python-ipython-doc_8.30.0-2_all.deb ... Unpacking python-ipython-doc (8.30.0-2) ... Selecting previously unselected package python-matplotlib-data. Preparing to unpack .../346-python-matplotlib-data_3.8.3-3_all.deb ... Unpacking python-matplotlib-data (3.8.3-3) ... Selecting previously unselected package python-mpltoolkits.basemap-doc. Preparing to unpack .../347-python-mpltoolkits.basemap-doc_1.2.2+dfsg-5_all.deb ... Unpacking python-mpltoolkits.basemap-doc (1.2.2+dfsg-5) ... Selecting previously unselected package python-pandas-doc. Preparing to unpack .../348-python-pandas-doc_2.2.3+dfsg-5_all.deb ... Unpacking python-pandas-doc (2.2.3+dfsg-5) ... Selecting previously unselected package python-scipy-doc. Preparing to unpack .../349-python-scipy-doc_1.14.1-3_all.deb ... Unpacking python-scipy-doc (1.14.1-3) ... Selecting previously unselected package python3-alabaster. Preparing to unpack .../350-python3-alabaster_0.7.16-0.1_all.deb ... Unpacking python3-alabaster (0.7.16-0.1) ... Selecting previously unselected package python3-attr. Preparing to unpack .../351-python3-attr_24.3.0-1_all.deb ... Unpacking python3-attr (24.3.0-1) ... Selecting previously unselected package python3-babel. Preparing to unpack .../352-python3-babel_2.16.0-1_all.deb ... Unpacking python3-babel (2.16.0-1) ... Selecting previously unselected package python3-brotli. Preparing to unpack .../353-python3-brotli_1.1.0-2+b6_amd64.deb ... Unpacking python3-brotli (1.1.0-2+b6) ... Selecting previously unselected package python3-cairo. Preparing to unpack .../354-python3-cairo_1.26.1-2+b1_amd64.deb ... Unpacking python3-cairo (1.26.1-2+b1) ... Selecting previously unselected package python3-cairo-dev. Preparing to unpack .../355-python3-cairo-dev_1.26.1-2_all.deb ... Unpacking python3-cairo-dev (1.26.1-2) ... Selecting previously unselected package python3-cairo-doc. Preparing to unpack .../356-python3-cairo-doc_1.26.1-2_all.deb ... Unpacking python3-cairo-doc (1.26.1-2) ... Selecting previously unselected package python3-certifi. Preparing to unpack .../357-python3-certifi_2024.12.14+ds-1_all.deb ... Unpacking python3-certifi (2024.12.14+ds-1) ... Selecting previously unselected package python3-chardet. Preparing to unpack .../358-python3-chardet_5.2.0+dfsg-2_all.deb ... Unpacking python3-chardet (5.2.0+dfsg-2) ... Selecting previously unselected package python3-charset-normalizer. Preparing to unpack .../359-python3-charset-normalizer_3.4.0-1+b1_amd64.deb ... Unpacking python3-charset-normalizer (3.4.0-1+b1) ... Selecting previously unselected package python3-numpy. Preparing to unpack .../360-python3-numpy_1%3a1.26.4+ds-13_amd64.deb ... Unpacking python3-numpy (1:1.26.4+ds-13) ... Selecting previously unselected package python3-contourpy. Preparing to unpack .../361-python3-contourpy_1.3.1-1_amd64.deb ... Unpacking python3-contourpy (1.3.1-1) ... Selecting previously unselected package python3-cycler. Preparing to unpack .../362-python3-cycler_0.12.1-1_all.deb ... Unpacking python3-cycler (0.12.1-1) ... Selecting previously unselected package python3-dateutil. Preparing to unpack .../363-python3-dateutil_2.9.0-3_all.deb ... Unpacking python3-dateutil (2.9.0-3) ... Selecting previously unselected package python3-decorator. Preparing to unpack .../364-python3-decorator_5.1.1-5_all.deb ... Unpacking python3-decorator (5.1.1-5) ... Selecting previously unselected package python3-defusedxml. Preparing to unpack .../365-python3-defusedxml_0.7.1-3_all.deb ... Unpacking python3-defusedxml (0.7.1-3) ... Selecting previously unselected package python3.13-doc. Preparing to unpack .../366-python3.13-doc_3.13.1-3_all.deb ... Unpacking python3.13-doc (3.13.1-3) ... Selecting previously unselected package python3-doc. Preparing to unpack .../367-python3-doc_3.13.1-2_all.deb ... Unpacking python3-doc (3.13.1-2) ... Selecting previously unselected package python3-roman. Preparing to unpack .../368-python3-roman_4.2-1_all.deb ... Unpacking python3-roman (4.2-1) ... Selecting previously unselected package python3-docutils. Preparing to unpack .../369-python3-docutils_0.21.2+dfsg-2_all.deb ... Unpacking python3-docutils (0.21.2+dfsg-2) ... Selecting previously unselected package python3-tz. Preparing to unpack .../370-python3-tz_2024.2-1_all.deb ... Unpacking python3-tz (2024.2-1) ... Selecting previously unselected package python3-platformdirs. Preparing to unpack .../371-python3-platformdirs_4.3.6-1_all.deb ... Unpacking python3-platformdirs (4.3.6-1) ... Selecting previously unselected package python3-fs. Preparing to unpack .../372-python3-fs_2.4.16-6_all.deb ... Unpacking python3-fs (2.4.16-6) ... Selecting previously unselected package python3-lxml:amd64. Preparing to unpack .../373-python3-lxml_5.3.0-1+b1_amd64.deb ... Unpacking python3-lxml:amd64 (5.3.0-1+b1) ... Selecting previously unselected package python3-lz4. Preparing to unpack .../374-python3-lz4_4.4.0+dfsg-1_amd64.deb ... Unpacking python3-lz4 (4.4.0+dfsg-1) ... Selecting previously unselected package python3-scipy. Preparing to unpack .../375-python3-scipy_1.14.1-3_amd64.deb ... Unpacking python3-scipy (1.14.1-3) ... Selecting previously unselected package python3-mpmath. Preparing to unpack .../376-python3-mpmath_1.3.0-1_all.deb ... Unpacking python3-mpmath (1.3.0-1) ... Selecting previously unselected package python3-sympy. Preparing to unpack .../377-python3-sympy_1.13.3-1_all.deb ... Unpacking python3-sympy (1.13.3-1) ... Selecting previously unselected package python3-ufolib2. Preparing to unpack .../378-python3-ufolib2_0.17.0+dfsg1-1_all.deb ... Unpacking python3-ufolib2 (0.17.0+dfsg1-1) ... Selecting previously unselected package python3-unicodedata2. Preparing to unpack .../379-python3-unicodedata2_15.1.0+ds-1+b3_amd64.deb ... Unpacking python3-unicodedata2 (15.1.0+ds-1+b3) ... Selecting previously unselected package unicode-data. Preparing to unpack .../380-unicode-data_15.1.0-1_all.deb ... Unpacking unicode-data (15.1.0-1) ... Selecting previously unselected package python3-fonttools. Preparing to unpack .../381-python3-fonttools_4.55.3-2_amd64.deb ... Unpacking python3-fonttools (4.55.3-2) ... Selecting previously unselected package python3-gi. Preparing to unpack .../382-python3-gi_3.50.0-4_amd64.deb ... Unpacking python3-gi (3.50.0-4) ... Selecting previously unselected package python3-idna. Preparing to unpack .../383-python3-idna_3.8-2_all.deb ... Unpacking python3-idna (3.8-2) ... Selecting previously unselected package python3-imagesize. Preparing to unpack .../384-python3-imagesize_1.4.1-1_all.deb ... Unpacking python3-imagesize (1.4.1-1) ... Selecting previously unselected package python3-markupsafe. Preparing to unpack .../385-python3-markupsafe_2.1.5-1+b2_amd64.deb ... Unpacking python3-markupsafe (2.1.5-1+b2) ... Selecting previously unselected package python3-jinja2. Preparing to unpack .../386-python3-jinja2_3.1.5-1_all.deb ... Unpacking python3-jinja2 (3.1.5-1) ... Selecting previously unselected package python3-kiwisolver. Preparing to unpack .../387-python3-kiwisolver_1.4.7-2+b1_amd64.deb ... Unpacking python3-kiwisolver (1.4.7-2+b1) ... Selecting previously unselected package python3-pil:amd64. Preparing to unpack .../388-python3-pil_11.1.0-1_amd64.deb ... Unpacking python3-pil:amd64 (11.1.0-1) ... Selecting previously unselected package python3.12-tk. Preparing to unpack .../389-python3.12-tk_3.12.8-5_amd64.deb ... Unpacking python3.12-tk (3.12.8-5) ... Selecting previously unselected package python3.13-tk. Preparing to unpack .../390-python3.13-tk_3.13.1-3_amd64.deb ... Unpacking python3.13-tk (3.13.1-3) ... Selecting previously unselected package python3-tk:amd64. Preparing to unpack .../391-python3-tk_3.13.1-1_amd64.deb ... Unpacking python3-tk:amd64 (3.13.1-1) ... Selecting previously unselected package python3-pil.imagetk:amd64. Preparing to unpack .../392-python3-pil.imagetk_11.1.0-1_amd64.deb ... Unpacking python3-pil.imagetk:amd64 (11.1.0-1) ... Selecting previously unselected package python3-pyparsing. Preparing to unpack .../393-python3-pyparsing_3.1.2-1_all.deb ... Unpacking python3-pyparsing (3.1.2-1) ... Selecting previously unselected package python3-matplotlib. Preparing to unpack .../394-python3-matplotlib_3.8.3-3+b1_amd64.deb ... Unpacking python3-matplotlib (3.8.3-3+b1) ... Selecting previously unselected package sphinx-common. Preparing to unpack .../395-sphinx-common_8.1.3-4_all.deb ... Unpacking sphinx-common (8.1.3-4) ... Selecting previously unselected package python3-pygments. Preparing to unpack .../396-python3-pygments_2.18.0+dfsg-2_all.deb ... Unpacking python3-pygments (2.18.0+dfsg-2) ... Selecting previously unselected package python3-urllib3. Preparing to unpack .../397-python3-urllib3_2.3.0-1_all.deb ... Unpacking python3-urllib3 (2.3.0-1) ... Selecting previously unselected package python3-requests. Preparing to unpack .../398-python3-requests_2.32.3+dfsg-1_all.deb ... Unpacking python3-requests (2.32.3+dfsg-1) ... Selecting previously unselected package python3-snowballstemmer. Preparing to unpack .../399-python3-snowballstemmer_2.2.0-4_all.deb ... Unpacking python3-snowballstemmer (2.2.0-4) ... Selecting previously unselected package python3-sphinx. Preparing to unpack .../400-python3-sphinx_8.1.3-4_all.deb ... Unpacking python3-sphinx (8.1.3-4) ... Selecting previously unselected package python3-tabulate. Preparing to unpack .../401-python3-tabulate_0.9.0-1_all.deb ... Unpacking python3-tabulate (0.9.0-1) ... Selecting previously unselected package python3-numpydoc. Preparing to unpack .../402-python3-numpydoc_1.8.0-1_all.deb ... Unpacking python3-numpydoc (1.8.0-1) ... Selecting previously unselected package texlive-fonts-recommended. Preparing to unpack .../403-texlive-fonts-recommended_2024.20250114-1_all.deb ... Unpacking texlive-fonts-recommended (2024.20250114-1) ... Selecting previously unselected package texlive-pictures. Preparing to unpack .../404-texlive-pictures_2024.20250114-1_all.deb ... Unpacking texlive-pictures (2024.20250114-1) ... Selecting previously unselected package texlive-latex-extra. Preparing to unpack .../405-texlive-latex-extra_2024.20250114-1_all.deb ... Unpacking texlive-latex-extra (2024.20250114-1) ... Selecting previously unselected package vpx-tools. Preparing to unpack .../406-vpx-tools_1.15.0-1_amd64.deb ... Unpacking vpx-tools (1.15.0-1) ... Selecting previously unselected package zstd. Preparing to unpack .../407-zstd_1.5.6+dfsg-2_amd64.deb ... Unpacking zstd (1.5.6+dfsg-2) ... Setting up media-types (10.1.0) ... Setting up libpipeline1:amd64 (1.5.8-1) ... Setting up libgraphite2-3:amd64 (1.3.14-2+b1) ... Setting up libboost-python1.83.0 (1.83.0-4) ... Setting up liblcms2-2:amd64 (2.16-2) ... Setting up libboost-program-options1.83.0:amd64 (1.83.0-4) ... Setting up libpixman-1-0:amd64 (0.44.0-3) ... Setting up libtext-charwidth-perl:amd64 (0.04-11+b4) ... Setting up libsharpyuv0:amd64 (1.5.0-0.1) ... Setting up systemd-sysv (257.2-2) ... Setting up libxau6:amd64 (1:1.0.11-1) ... Setting up libxdmcp6:amd64 (1:1.1.5-1) ... Setting up libnpth0t64:amd64 (1.8-2) ... Setting up libkeyutils1:amd64 (1.6.3-4) ... Setting up libboost1.83-dev:amd64 (1.83.0-4) ... Setting up libxcb1:amd64 (1.17.0-2+b1) ... Setting up fonts-lato (2.015-1) ... Setting up fonts-mathjax (2.7.9+dfsg-1) ... Setting up libpixman-1-dev:amd64 (0.44.0-3) ... Setting up native-architecture (0.2.3) ... Setting up libicu72:amd64 (72.1-6) ... Setting up liblerc4:amd64 (4.0.0+ds-5) ... Setting up bsdextrautils (2.40.4-1) ... Setting up hicolor-icon-theme (0.18-2) ... Setting up libjs-mathjax (2.7.9+dfsg-1) ... Setting up libboost-date-time1.83.0:amd64 (1.83.0-4) ... Setting up libgpg-error0:amd64 (1.51-3) ... Setting up libdatrie1:amd64 (0.2.13-3+b1) ... Setting up libmagic-mgc (1:5.45-3+b1) ... Setting up libxcb-render0:amd64 (1.17.0-2+b1) ... Setting up libarchive-zip-perl (1.68-1) ... Setting up fonts-lyx (2.4.3-1) ... Setting up libboost-regex1.83.0:amd64 (1.83.0-4) ... Setting up libdebhelper-perl (13.24.1) ... Setting up libbrotli1:amd64 (1.1.0-2+b6) ... Setting up libfontbox-java (1:1.8.16-5) ... Setting up libboost-system1.83.0:amd64 (1.83.0-4) ... Setting up libgdk-pixbuf2.0-common (2.42.12+dfsg-2) ... Setting up libboost-context1.83.0:amd64 (1.83.0-4) ... Setting up libmagic1t64:amd64 (1:5.45-3+b1) ... Setting up libboost-program-options1.83-dev:amd64 (1.83.0-4) ... Setting up x11-common (1:7.7+23.2) ... Running in chroot, ignoring request. Setting up X socket directories... /tmp/.X11-unix /tmp/.ICE-unix. Setting up libnghttp2-14:amd64 (1.64.0-1) ... Setting up libdeflate0:amd64 (1.23-1+b1) ... Setting up libboost-thread1.83.0:amd64 (1.83.0-4) ... Setting up gettext-base (0.23.1-1) ... Setting up m4 (1.4.19-5) ... Setting up libgcrypt20:amd64 (1.11.0-7) ... Setting up libqhull-r8.0:amd64 (2020.2-6+b2) ... Setting up xkb-data (2.42-1) ... Setting up liblzo2-2:amd64 (2.10-3+b1) ... Setting up autoconf-archive (20220903-3) ... Setting up libxcb-shm0:amd64 (1.17.0-2+b1) ... Setting up libcom-err2:amd64 (1.47.2-1) ... Setting up file (1:5.45-3+b1) ... Setting up fonts-open-sans (1.11-2) ... Setting up libsparsehash-dev (2.0.3-2) ... Setting up libtext-wrapi18n-perl (0.06-10) ... Setting up libjbig0:amd64 (2.1-6.1+b2) ... Setting up libpcre2-16-0:amd64 (10.44-5) ... Setting up libelf1t64:amd64 (0.192-4) ... Setting up python-babel-localedata (2.16.0-1) ... Setting up libkrb5support0:amd64 (1.21.3-4) ... Setting up libsasl2-modules-db:amd64 (2.1.28+dfsg1-8+b1) ... Setting up tzdata (2025a-1) ... Current default time zone: 'Etc/UTC' Local time is now: Wed Feb 25 07:41:23 UTC 2026. Universal Time is now: Wed Feb 25 07:41:23 UTC 2026. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up libboost-atomic1.83.0:amd64 (1.83.0-4) ... Setting up unicode-data (15.1.0-1) ... Setting up libsysprof-capture-4-dev:amd64 (47.2-1) ... Setting up libboost-serialization1.83.0:amd64 (1.83.0-4) ... Setting up xtrans-dev (1.4.0-1) ... Setting up autotools-dev (20220109.1) ... Setting up libpcre2-32-0:amd64 (10.44-5) ... Setting up libblas3:amd64 (3.12.0-4) ... update-alternatives: using /usr/lib/x86_64-linux-gnu/blas/libblas.so.3 to provide /usr/lib/x86_64-linux-gnu/libblas.so.3 (libblas.so.3-x86_64-linux-gnu) in auto mode Setting up libglib2.0-data (2.82.4-2) ... Setting up libpkgconf3:amd64 (1.8.1-4) ... Setting up libgmpxx4ldbl:amd64 (2:6.3.0+dfsg-3) ... Setting up libexpat1-dev:amd64 (2.6.4-1) ... Setting up libjpeg62-turbo:amd64 (1:2.1.5-3+b1) ... Setting up libzzip-0-13t64:amd64 (0.13.72+dfsg.1-1.3) ... Setting up libboost-program-options-dev:amd64 (1.83.0.2+b2) ... Setting up libx11-data (2:1.8.10-2) ... Setting up libepoxy0:amd64 (1.5.10-2) ... Setting up libnspr4:amd64 (2:4.36-1) ... Setting up libboost-chrono1.83.0t64:amd64 (1.83.0-4) ... Setting up gnupg-l10n (2.2.46-1) ... Setting up libteckit0:amd64 (2.5.12+ds1-1+b1) ... Setting up uuid-dev:amd64 (2.40.4-1) ... Setting up libapache-pom-java (33-2) ... Setting up libavahi-common-data:amd64 (0.8-16) ... Setting up libdbus-1-3:amd64 (1.16.0-1) ... Setting up libfribidi0:amd64 (1.0.16-1) ... Setting up t1utils (1.41-4) ... Setting up libtexlua53-5:amd64 (2024.20240313.70630+ds-5+b1) ... Setting up libimagequant0:amd64 (2.18.0-1+b2) ... Setting up libproc2-0:amd64 (2:4.0.4-6) ... Setting up libunistring5:amd64 (1.3-1) ... Setting up fonts-dejavu-mono (2.37-8) ... Setting up libpng16-16t64:amd64 (1.6.45-1) ... Setting up libtcl8.6:amd64 (8.6.16+dfsg-1) ... Setting up autopoint (0.23.1-1) ... Setting up libmpfi0:amd64 (1.5.4+ds-4) ... Setting up icu-devtools (72.1-6) ... Setting up fonts-dejavu-core (2.37-8) ... Setting up libsepol-dev:amd64 (3.7-1) ... Setting up pkgconf-bin (1.8.1-4) ... Setting up libk5crypto3:amd64 (1.21.3-4) ... Setting up libboost-test1.83.0:amd64 (1.83.0-4) ... Setting up libkpathsea6:amd64 (2024.20240313.70630+ds-5+b1) ... Setting up libsasl2-2:amd64 (2.1.28+dfsg1-8+b1) ... Setting up libgfortran5:amd64 (14.2.0-14) ... Setting up libboost-atomic1.83-dev:amd64 (1.83.0-4) ... Setting up autoconf (2.72-3) ... Setting up libnghttp3-9:amd64 (1.6.0-2) ... Setting up libwebp7:amd64 (1.5.0-0.1) ... Setting up zlib1g-dev:amd64 (1:1.3.dfsg+really1.3.1-1+b1) ... Setting up libffi8:amd64 (3.4.6-1) ... Setting up libpcre2-posix3:amd64 (10.44-5) ... Setting up libvpx9:amd64 (1.15.0-1) ... Setting up dwz (0.15-1+b1) ... Setting up libdav1d7:amd64 (1.5.0-1+b1) ... Setting up sensible-utils (0.0.24) ... Setting up at-spi2-common (2.55.0.1-1) ... Setting up libtiff6:amd64 (4.5.1+git230720-5) ... Setting up dbus-session-bus-common (1.16.0-1) ... Setting up libuchardet0:amd64 (0.0.8-1+b2) ... Setting up libassuan9:amd64 (3.0.1-2) ... Setting up procps (2:4.0.4-6) ... Setting up libjson-perl (4.10000-1) ... Setting up libboost-graph1.83.0:amd64 (1.83.0-4) ... Setting up libtasn1-6:amd64 (4.19.0-3+b3) ... Setting up fonts-lmodern (2.005-1) ... Setting up libopenjp2-7:amd64 (2.5.0-2+b4) ... Setting up libx11-6:amd64 (2:1.8.10-2) ... Setting up libthai-data (0.1.29-2) ... Setting up xorg-sgml-doctools (1:1.11-1.1) ... Setting up netbase (6.4) ... Setting up libngtcp2-16:amd64 (1.9.1-1) ... Setting up sgml-base (1.31) ... Setting up libkrb5-3:amd64 (1.21.3-4) ... Setting up libboost-dev:amd64 (1.83.0.2+b2) ... Setting up libwayland-egl1:amd64 (1.23.0-1+b1) ... Setting up libboost-system1.83-dev:amd64 (1.83.0-4) ... Setting up libpaper2:amd64 (2.2.5-0.3) ... Setting up libssh2-1t64:amd64 (1.11.1-1) ... Setting up libjs-jquery (3.6.1+dfsg+~3.5.14-1) ... Setting up dbus-system-bus-common (1.16.0-1) ... useradd: Warning: missing or non-executable shell '/usr/sbin/nologin' Setting up python-matplotlib-data (3.8.3-3) ... Setting up openssl (3.4.0-2) ... Setting up libwebpmux3:amd64 (1.5.0-0.1) ... Setting up libxcomposite1:amd64 (1:0.4.6-1) ... Setting up readline-common (8.2-6) ... Setting up libicu-dev:amd64 (72.1-6) ... Setting up libxml2:amd64 (2.12.7+dfsg+really2.9.14-0.2+b1) ... Setting up fonts-font-awesome (5.0.10+really4.7.0~dfsg-4.1) ... Setting up sphinx-rtd-theme-common (3.0.2+dfsg-2) ... Setting up xdg-utils (1.2.1-2) ... update-alternatives: using /usr/bin/xdg-open to provide /usr/bin/open (open) in auto mode Setting up zstd (1.5.6+dfsg-2) ... Setting up libldap2:amd64 (2.6.9+dfsg-1) ... Setting up dbus-bin (1.16.0-1) ... Setting up libbrotli-dev:amd64 (1.1.0-2+b6) ... Setting up libsynctex2:amd64 (2024.20240313.70630+ds-5+b1) ... Setting up libjs-underscore (1.13.4~dfsg+~1.11.4-3) ... Setting up libbz2-dev:amd64 (1.0.8-6) ... Setting up libxkbcommon0:amd64 (1.7.0-2) ... Setting up libpotrace0:amd64 (1.16-2+b2) ... Setting up libwayland-client0:amd64 (1.23.0-1+b1) ... Setting up automake (1:1.16.5-1.3) ... update-alternatives: using /usr/bin/automake-1.16 to provide /usr/bin/automake (automake) in auto mode Setting up libksba8:amd64 (1.6.7-2+b1) ... Setting up pinentry-curses (1.3.1-2) ... Setting up x11proto-dev (2024.1-1) ... Setting up libfile-stripnondeterminism-perl (1.14.1-1) ... Setting up libblkid-dev:amd64 (2.40.4-1) ... Setting up libice6:amd64 (2:1.1.1-1) ... Setting up liblapack3:amd64 (3.12.0-4) ... update-alternatives: using /usr/lib/x86_64-linux-gnu/lapack/liblapack.so.3 to provide /usr/lib/x86_64-linux-gnu/liblapack.so.3 (liblapack.so.3-x86_64-linux-gnu) in auto mode Setting up gettext (0.23.1-1) ... Setting up libboost-coroutine1.83.0:amd64 (1.83.0-4) ... Setting up libxdamage1:amd64 (1:1.1.6-1+b2) ... Setting up libgmp-dev:amd64 (2:6.3.0+dfsg-3) ... Setting up libpdfbox-java (1:1.8.16-5) ... Setting up libxau-dev:amd64 (1:1.0.11-1) ... Setting up libboost-chrono1.83-dev:amd64 (1.83.0-4) ... Setting up libxpm4:amd64 (1:3.5.17-1+b3) ... Setting up libpcre2-dev:amd64 (10.44-5) ... Setting up libxrender1:amd64 (1:0.9.10-1.1+b3) ... Setting up libice-dev:amd64 (2:1.1.1-1) ... Setting up libtool (2.5.4-2) ... Setting up libselinux1-dev:amd64 (3.7-3+b1) ... Setting up fontconfig-config (2.15.0-2) ... Setting up libwebpdemux2:amd64 (1.5.0-0.1) ... Setting up libboost-system-dev:amd64 (1.83.0.2+b2) ... Setting up libpng-dev:amd64 (1.6.45-1) ... Setting up libcommons-parent-java (56-1) ... Setting up libavahi-common3:amd64 (0.8-16) ... Setting up libboost-serialization1.83-dev:amd64 (1.83.0-4) ... Setting up libcommons-logging-java (1.3.0-1) ... Setting up libxext6:amd64 (2:1.3.4-1+b3) ... Setting up libboost-test1.83-dev:amd64 (1.83.0-4) ... Setting up libidn2-0:amd64 (2.3.7-2+b1) ... Setting up libnss3:amd64 (2:3.107-1) ... Setting up dbus-daemon (1.16.0-1) ... Setting up libpaper-utils (2.2.5-0.3) ... Setting up libffi-dev:amd64 (3.4.6-1) ... Setting up libmpfr-dev:amd64 (4.2.1-1+b2) ... Setting up pkgconf:amd64 (1.8.1-4) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up dh-autoreconf (20) ... Setting up libsigc++-2.0-dev:amd64 (2.12.1-3) ... Setting up python3.13-doc (3.13.1-3) ... Setting up libthai0:amd64 (0.1.29-2+b1) ... Setting up ca-certificates (20241223) ... Updating certificates in /etc/ssl/certs... 152 added, 0 removed; done. Setting up libxdmcp-dev:amd64 (1:1.1.5-1) ... Setting up libglib2.0-0t64:amd64 (2.82.4-2) ... Setting up libjs-jquery-ui (1.13.2+dfsg-1) ... Setting up libptexenc1:amd64 (2024.20240313.70630+ds-5+b1) ... Setting up libfreetype6:amd64 (2.13.3+dfsg-1) ... Setting up libxfixes3:amd64 (1:6.0.0-2+b3) ... Setting up libboost-date-time1.83-dev:amd64 (1.83.0-4) ... Setting up x11proto-core-dev (2024.1-1) ... Setting up dbus (1.16.0-1) ... Running in chroot, ignoring request. invoke-rc.d: policy-rc.d denied execution of start. Setting up shared-mime-info (2.4-5+b1) ... Setting up libp11-kit0:amd64 (0.25.5-3) ... Setting up libxinerama1:amd64 (2:1.1.4-3+b3) ... Setting up libgssapi-krb5-2:amd64 (1.21.3-4) ... Setting up libxrandr2:amd64 (2:1.5.4-1+b2) ... Setting up libboost-regex1.83-dev:amd64 (1.83.0-4) ... Setting up ucf (3.0048) ... Setting up gir1.2-glib-2.0:amd64 (2.82.4-2) ... Setting up vpx-tools (1.15.0-1) ... Setting up libjs-sphinxdoc (8.1.3-4) ... Setting up libreadline8t64:amd64 (8.2-6) ... Setting up dh-strip-nondeterminism (1.14.1-1) ... Setting up groff-base (1.23.0-7) ... Setting up libwayland-cursor0:amd64 (1.23.0-1+b1) ... Setting up xml-core (0.19) ... Setting up libxslt1.1:amd64 (1.1.35-1.1+b1) ... Setting up gpgconf (2.2.46-1+b1) ... Setting up libpam-systemd:amd64 (257.2-2) ... Setting up libharfbuzz0b:amd64 (10.2.0-1) ... Setting up libgirepository-1.0-1:amd64 (1.82.0-4) ... Setting up libgdk-pixbuf-2.0-0:amd64 (2.42.12+dfsg-2) ... Setting up python-mpltoolkits.basemap-doc (1.2.2+dfsg-5) ... Setting up libxss1:amd64 (1:1.2.3-1+b3) ... Setting up libfontconfig1:amd64 (2.15.0-2) ... Setting up libboost-regex-dev:amd64 (1.83.0.2+b2) ... Setting up libsm6:amd64 (2:1.2.4-1) ... Setting up libpython3.13-stdlib:amd64 (3.13.1-3) ... Setting up libavahi-client3:amd64 (0.8-16) ... Setting up libmount-dev:amd64 (2.40.4-1) ... Setting up python3-doc (3.13.1-2) ... Setting up gpg (2.2.46-1+b1) ... Setting up libpython3-stdlib:amd64 (3.13.1-2) ... Setting up liblbfgsb0:amd64 (3.0+dfsg.4-1+b2) ... Setting up python3-cairo-doc (1.26.1-2) ... Setting up libpython3.13:amd64 (3.13.1-3) ... Setting up libgnutls30t64:amd64 (3.8.8-2) ... Setting up libboost-thread1.83-dev:amd64 (1.83.0-4) ... Setting up gtk-update-icon-cache (4.16.12+ds-1) ... Setting up fontconfig (2.15.0-2) ... Regenerating fonts cache... done. Setting up libxft2:amd64 (2.3.6-1+b3) ... Setting up libgio-2.0-dev:amd64 (2.82.4-2) ... Setting up gpg-agent (2.2.46-1+b1) ... Created symlink '/etc/systemd/user/sockets.target.wants/gpg-agent-browser.socket' -> '/usr/lib/systemd/user/gpg-agent-browser.socket'. Created symlink '/etc/systemd/user/sockets.target.wants/gpg-agent-extra.socket' -> '/usr/lib/systemd/user/gpg-agent-extra.socket'. Created symlink '/etc/systemd/user/sockets.target.wants/gpg-agent-ssh.socket' -> '/usr/lib/systemd/user/gpg-agent-ssh.socket'. Created symlink '/etc/systemd/user/sockets.target.wants/gpg-agent.socket' -> '/usr/lib/systemd/user/gpg-agent.socket'. Setting up libxcb1-dev:amd64 (1.17.0-2+b1) ... Setting up libatk1.0-0t64:amd64 (2.55.0.1-1) ... Setting up libxi6:amd64 (2:1.8.2-1) ... Setting up gir1.2-gdkpixbuf-2.0:amd64 (2.42.12+dfsg-2) ... Setting up python-pandas-doc (2.2.3+dfsg-5) ... Setting up python3.13 (3.13.1-3) ... Setting up libgirepository-2.0-0:amd64 (2.82.4-2) ... Setting up gir1.2-atk-1.0:amd64 (2.55.0.1-1) ... Setting up python-ipython-doc (8.30.0-2) ... Setting up libsm-dev:amd64 (2:1.2.4-1) ... Setting up libboost-iostreams1.83-dev:amd64 (1.83.0-4) ... Setting up po-debconf (1.0.21+nmu1) ... Setting up libtk8.6:amd64 (8.6.16-1) ... Setting up libxcursor1:amd64 (1:1.2.3-1) ... Setting up gpgsm (2.2.46-1+b1) ... Setting up libpango-1.0-0:amd64 (1.56.1-1) ... Setting up python3.12-tk (3.12.8-5) ... Setting up libpsl5t64:amd64 (0.21.2-1.1+b1) ... Setting up libx11-dev:amd64 (2:1.8.10-2) ... Setting up libcloudproviders0:amd64 (0.3.6-1+b1) ... Setting up libglib2.0-bin (2.82.4-2) ... Setting up python3 (3.13.1-2) ... Setting up libharfbuzz-gobject0:amd64 (10.2.0-1) ... Setting up libboost-iostreams-dev:amd64 (1.83.0.2+b2) ... Setting up python3-zipp (3.21.0-1) ... Setting up python3-autocommand (2.2.2-3) ... Setting up man-db (2.13.0-1) ... Not building database; man-db/auto-update is not 'true'. Created symlink '/etc/systemd/system/timers.target.wants/man-db.timer' -> '/usr/lib/systemd/system/man-db.timer'. Setting up python3-markupsafe (2.1.5-1+b2) ... Setting up libboost-graph1.83-dev:amd64 (1.83.0-4) ... Setting up libcairo2:amd64 (1.18.2-2) ... Setting up python3.13-tk (3.13.1-3) ... Setting up libcolord2:amd64 (1.4.7-1+b2) ... Setting up python3-platformdirs (4.3.6-1) ... Setting up python3-tz (2024.2-1) ... Setting up libfreetype-dev:amd64 (2.13.3+dfsg-1) ... Setting up libboost-context1.83-dev:amd64 (1.83.0-4) ... Setting up python3-fs (2.4.16-6) ... Setting up libcairomm-1.0-1v5:amd64 (1.14.5-2+b1) ... Setting up libdconf1:amd64 (0.40.0-5) ... Setting up tex-common (6.18) ... update-language: texlive-base not installed and configured, doing nothing! Setting up libboost-coroutine1.83-dev:amd64 (1.83.0-4) ... Setting up dirmngr (2.2.46-1+b1) ... Created symlink '/etc/systemd/user/sockets.target.wants/dirmngr.socket' -> '/usr/lib/systemd/user/dirmngr.socket'. Setting up libxcb-shm0-dev:amd64 (1.17.0-2+b1) ... Setting up dbus-user-session (1.16.0-1) ... Setting up python3-roman (4.2-1) ... Setting up python3-decorator (5.1.1-5) ... Setting up python3-jinja2 (3.1.5-1) ... Setting up python3-pygments (2.18.0+dfsg-2) ... Setting up python3-packaging (24.2-1) ... Setting up python3-chardet (5.2.0+dfsg-2) ... Setting up python3-pyparsing (3.1.2-1) ... Setting up adwaita-icon-theme (47.0-2) ... update-alternatives: using /usr/share/icons/Adwaita/cursor.theme to provide /usr/share/icons/default/index.theme (x-cursor-theme) in auto mode Setting up python3-certifi (2024.12.14+ds-1) ... Setting up librtmp1:amd64 (2.4+20151223.gitfa8646d.1-2+b5) ... Setting up gir1.2-girepository-2.0:amd64 (1.82.0-4) ... Setting up python3-snowballstemmer (2.2.0-4) ... Setting up python3-brotli (1.1.0-2+b6) ... Setting up libatspi2.0-0t64:amd64 (2.55.0.1-1) ... Setting up libraqm0:amd64 (0.10.2-1) ... Setting up libpython3.13-dev:amd64 (3.13.1-3) ... Setting up sphinx-common (8.1.3-4) ... Setting up python-scipy-doc (1.14.1-3) ... Setting up python3-gi (3.50.0-4) ... Setting up python3-cycler (0.12.1-1) ... Setting up libxt6t64:amd64 (1:1.2.1-1.2+b2) ... Setting up python3-kiwisolver (1.4.7-2+b1) ... Setting up python3-idna (3.8-2) ... Setting up python3-typing-extensions (4.12.2-2) ... Setting up libxcb-render0-dev:amd64 (1.17.0-2+b1) ... Setting up python3-numpy (1:1.26.4+ds-13) ... Setting up python3-urllib3 (2.3.0-1) ... Setting up libxext-dev:amd64 (2:1.3.4-1+b3) ... Setting up python3-lxml:amd64 (5.3.0-1+b1) ... Setting up gnupg (2.2.46-1) ... Setting up python3-dateutil (2.9.0-3) ... Setting up python3-contourpy (1.3.1-1) ... Setting up libcairo-gobject2:amd64 (1.18.2-2) ... Setting up libboost-coroutine-dev:amd64 (1.83.0.2+b2) ... Setting up libgpgme11t64:amd64 (1.24.1-2) ... Setting up libpangoft2-1.0-0:amd64 (1.56.1-1) ... Setting up python3-mpmath (1.3.0-1) ... Setting up libxrender-dev:amd64 (1:0.9.10-1.1+b3) ... Setting up libcups2t64:amd64 (2.4.10-2+b1) ... Setting up libngtcp2-crypto-gnutls8:amd64 (1.9.1-1) ... Setting up libboost-thread-dev:amd64 (1.83.0.2+b2) ... Setting up libpangocairo-1.0-0:amd64 (1.56.1-1) ... Setting up python3-imagesize (1.4.1-1) ... Setting up libcairo-script-interpreter2:amd64 (1.18.2-2) ... Setting up libatk-bridge2.0-0t64:amd64 (2.55.0.1-1) ... Setting up python3-more-itertools (10.6.0-1) ... Setting up python3-sympy (1.13.3-1) ... Setting up python3-attr (24.3.0-1) ... Setting up libgpgmepp6t64:amd64 (1.24.1-2) ... Setting up libboost-graph-dev:amd64 (1.83.0.2+b2) ... Setting up tk8.6-blt2.5 (2.5.3+dfsg-7) ... Setting up libgio-2.0-dev-bin (2.82.4-2) ... Setting up libxmu6:amd64 (2:1.1.3-3+b4) ... Setting up gir1.2-freedesktop:amd64 (1.82.0-4) ... Setting up girepository-tools:amd64 (2.82.4-2) ... Setting up python3-scipy (1.14.1-3) ... Setting up libpython3-dev:amd64 (3.13.1-2) ... Setting up python3-cairo (1.26.1-2+b1) ... Setting up python3-jaraco.functools (4.1.0-1) ... Setting up libpangoxft-1.0-0:amd64 (1.56.1-1) ... Setting up python3-jaraco.context (6.0.0-1) ... Setting up python3-lz4 (4.4.0+dfsg-1) ... Setting up libfontconfig-dev:amd64 (2.15.0-2) ... Setting up python3-defusedxml (0.7.1-3) ... Setting up python3-charset-normalizer (3.4.0-1+b1) ... Setting up python3.13-dev (3.13.1-3) ... Setting up python3-alabaster (0.7.16-0.1) ... Setting up python3-unicodedata2 (15.1.0+ds-1+b3) ... Setting up blt (2.5.3+dfsg-7) ... Setting up preview-latex-style (13.2-1) ... Setting up python3-typeguard (4.4.1-1) ... Setting up libcurl3t64-gnutls:amd64 (8.11.1-1+b1) ... Setting up python3-tabulate (0.9.0-1) ... Setting up python3-tk:amd64 (3.13.1-1) ... Setting up debhelper (13.24.1) ... Setting up dconf-service (0.40.0-5) ... Setting up libxaw7:amd64 (2:1.0.16-1) ... Setting up gir1.2-harfbuzz-0.0:amd64 (10.2.0-1) ... Setting up libcgal-dev:amd64 (6.0.1-1) ... Setting up librsvg2-2:amd64 (2.59.2+dfsg-1) ... Setting up python3-pil:amd64 (11.1.0-1) ... Setting up python3-inflect (7.3.1-2) ... Setting up gir1.2-pango-1.0:amd64 (1.56.1-1) ... Setting up python3-pil.imagetk:amd64 (11.1.0-1) ... Setting up python3-jaraco.text (4.0.0-1) ... Setting up python3-dev (3.13.1-2) ... Setting up python3-requests (2.32.3+dfsg-1) ... Setting up libboost-python1.83-dev (1.83.0-4) ... Setting up librsvg2-common:amd64 (2.59.2+dfsg-1) ... Setting up texlive-binaries (2024.20240313.70630+ds-5+b1) ... update-alternatives: using /usr/bin/xdvi-xaw to provide /usr/bin/xdvi.bin (xdvi.bin) in auto mode update-alternatives: using /usr/bin/bibtex.original to provide /usr/bin/bibtex (bibtex) in auto mode Setting up python3-cairo-dev (1.26.1-2) ... Setting up libpoppler140:amd64 (24.08.0-4) ... Setting up poppler-utils (24.08.0-4) ... Setting up texlive-base (2024.20250114-1) ... tl-paper: setting paper size for dvips to a4: /var/lib/texmf/dvips/config/config-paper.ps tl-paper: setting paper size for dvipdfmx to a4: /var/lib/texmf/dvipdfmx/dvipdfmx-paper.cfg tl-paper: setting paper size for xdvi to a4: /var/lib/texmf/xdvi/XDvi-paper tl-paper: setting paper size for pdftex to a4: /var/lib/texmf/tex/generic/tex-ini-files/pdftexconfig.tex Setting up python3-pkg-resources (75.6.0-1) ... Setting up libglib2.0-dev-bin (2.82.4-2) ... Setting up python3-setuptools (75.6.0-1) ... Setting up dconf-gsettings-backend:amd64 (0.40.0-5) ... Setting up python3-babel (2.16.0-1) ... update-alternatives: using /usr/bin/pybabel-python3 to provide /usr/bin/pybabel (pybabel) in auto mode Setting up libboost-python-dev (1.83.0.2+b2) ... Setting up libglib2.0-dev:amd64 (2.82.4-2) ... Setting up texlive-latex-base (2024.20250114-1) ... Setting up texlive-latex-recommended (2024.20250114-1) ... Setting up texlive-pictures (2024.20250114-1) ... Setting up texlive-fonts-recommended (2024.20250114-1) ... Setting up libcairo2-dev:amd64 (1.18.2-2) ... Setting up libgtk-3-common (3.24.43-5) ... Setting up cm-super-minimal (0.3.4-17) ... Setting up dh-python (6.20250108) ... Setting up latexmk (1:4.86~ds-1) ... Setting up texlive-latex-extra (2024.20250114-1) ... Setting up libcairomm-1.0-dev:amd64 (1.14.5-2+b1) ... Setting up libgtk-3-0t64:amd64 (3.24.43-5) ... Setting up gir1.2-gtk-3.0:amd64 (3.24.43-5) ... Setting up python3-ufolib2 (0.17.0+dfsg1-1) ... Setting up python3-fonttools (4.55.3-2) ... Setting up python3-matplotlib (3.8.3-3+b1) ... Processing triggers for libc-bin (2.40-5) ... Processing triggers for systemd (257.2-2) ... Processing triggers for sgml-base (1.31) ... Setting up docutils-common (0.21.2+dfsg-2) ... Processing triggers for sgml-base (1.31) ... Setting up python3-docutils (0.21.2+dfsg-2) ... Setting up python3-sphinx (8.1.3-4) ... Setting up python3-numpydoc (1.8.0-1) ... Processing triggers for ca-certificates (20241223) ... Updating certificates in /etc/ssl/certs... 0 added, 0 removed; done. Running hooks in /etc/ca-certificates/update.d... done. Processing triggers for libgdk-pixbuf-2.0-0:amd64 (2.42.12+dfsg-2) ... Processing triggers for tex-common (6.18) ... Running updmap-sys. This may take some time... done. Running mktexlsr /var/lib/texmf ... done. Building format(s) --all. This may take some time... done. Reading package lists... Building dependency tree... Reading state information... Reading extended state information... Initializing package states... Writing extended state information... Building tag database... -> Finished parsing the build-deps I: Building the package I: Running cd /build/reproducible-path/graph-tool-2.77+ds/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-genchanges -S > ../graph-tool_2.77+ds-3_source.changes dpkg-buildpackage: info: source package graph-tool dpkg-buildpackage: info: source version 2.77+ds-3 dpkg-buildpackage: info: source distribution unstable dpkg-buildpackage: info: source changed by Santiago Vila dpkg-source --before-build . dpkg-buildpackage: info: host architecture amd64 debian/rules clean dh clean --with python3 --builddirectory=_BUILD dh_auto_clean -O--builddirectory=_BUILD dh_autoreconf_clean -O--builddirectory=_BUILD debian/rules override_dh_clean make[1]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds' find debian/adhoc/provide/doc/ -type f | sed 's@debian/adhoc/provide/@@g' | xargs rm -vf dh_clean rm -f debian/debhelper-build-stamp rm -rf debian/.debhelper/ rm -f -- debian/python3-graph-tool.substvars debian/graph-tool-doc.substvars debian/files rm -fr -- debian/python3-graph-tool/ debian/tmp/ debian/graph-tool-doc/ find . \( \( \ \( -path .\*/.git -o -path .\*/.svn -o -path .\*/.bzr -o -path .\*/.hg -o -path .\*/CVS -o -path .\*/.pc -o -path .\*/_darcs \) -prune -o -type f -a \ \( -name '#*#' -o -name '.*~' -o -name '*~' -o -name DEADJOE \ -o -name '*.orig' -o -name '*.rej' -o -name '*.bak' \ -o -name '.*.orig' -o -name .*.rej -o -name '.SUMS' \ -o -name TAGS -o \( -path '*/.deps/*' -a -name '*.P' \) \ \) -exec rm -f {} + \) -o \ \( -type d -a \( -name autom4te.cache -o -name __pycache__ \) -prune -exec rm -rf {} + \) \) make[1]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds' debian/rules binary dh binary --with python3 --builddirectory=_BUILD dh_update_autotools_config -O--builddirectory=_BUILD dh_autoreconf -O--builddirectory=_BUILD find ! -ipath "./debian/*" -a ! \( -path '*/.git/*' -o -path '*/.hg/*' -o -path '*/.bzr/*' -o -path '*/.svn/*' -o -path '*/CVS/*' \) -a -type f -exec md5sum {} + -o -type l -printf "symlink %p " > debian/autoreconf.before grep -q ^XDT_ configure.ac autoreconf -f -i libtoolize: putting auxiliary files in AC_CONFIG_AUX_DIR, 'build-aux'. libtoolize: copying file 'build-aux/ltmain.sh' libtoolize: putting macros in AC_CONFIG_MACRO_DIRS, 'm4'. libtoolize: copying file 'm4/libtool.m4' libtoolize: copying file 'm4/ltoptions.m4' libtoolize: copying file 'm4/ltsugar.m4' libtoolize: copying file 'm4/ltversion.m4' libtoolize: copying file 'm4/lt~obsolete.m4' libtoolize: Consider adding '-I m4' to ACLOCAL_AMFLAGS in Makefile.am. configure.ac:26: installing 'build-aux/compile' configure.ac:21: installing 'build-aux/config.guess' configure.ac:21: installing 'build-aux/config.sub' configure.ac:22: installing 'build-aux/install-sh' configure.ac:22: installing 'build-aux/missing' Makefile.am: installing 'build-aux/depcomp' Makefile.am:787: installing 'build-aux/py-compile' find ! -ipath "./debian/*" -a ! \( -path '*/.git/*' -o -path '*/.hg/*' -o -path '*/.bzr/*' -o -path '*/.svn/*' -o -path '*/CVS/*' \) -a -type f -exec md5sum {} + -o -type l -printf "symlink %p " > debian/autoreconf.after debian/rules override_dh_auto_configure make[1]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds' ## see d/patches/upstream-fix-autotools-automake-doc-missing.patch cp -vprd -t doc debian/adhoc/provide/doc/* 'debian/adhoc/provide/doc/demos/animation/animation_dancing.py' -> 'doc/demos/animation/animation_dancing.py' 'debian/adhoc/provide/doc/demos/animation/animation_sirs.py' -> 'doc/demos/animation/animation_sirs.py' 'debian/adhoc/provide/doc/demos/animation/animation_zombies.py' -> 'doc/demos/animation/animation_zombies.py' 'debian/adhoc/provide/doc/demos/animation/face-grin.png' -> 'doc/demos/animation/face-grin.png' 'debian/adhoc/provide/doc/demos/animation/face-surprise.png' -> 'doc/demos/animation/face-surprise.png' 'debian/adhoc/provide/doc/demos/animation/interactive_bst.py' -> 'doc/demos/animation/interactive_bst.py' 'debian/adhoc/provide/doc/demos/animation/zombie.png' -> 'doc/demos/animation/zombie.png' 'debian/adhoc/provide/doc/demos/inference/blockmodel-example.gt.gz' -> 'doc/demos/inference/blockmodel-example.gt.gz' 'debian/adhoc/provide/doc/demos/inference/nested-diagram.svg' -> 'doc/demos/inference/nested-diagram.svg' 'debian/adhoc/provide/doc/demos/matplotlib' -> 'doc/demos/matplotlib' 'debian/adhoc/provide/doc/demos/matplotlib/matplotlib.rst' -> 'doc/demos/matplotlib/matplotlib.rst' 'debian/adhoc/provide/doc/extlinks_fancy.py' -> 'doc/extlinks_fancy.py' 'debian/adhoc/provide/doc/mincut-example.xml.gz' -> 'doc/mincut-example.xml.gz' 'debian/adhoc/provide/doc/mincut-st-example.xml.gz' -> 'doc/mincut-st-example.xml.gz' PYTHON_VERSION=3.13 \ PYTHON_SITE_PKG=/usr/lib/python3.13/dist-packages \ dh_auto_configure -- \ --with-sparsehash-prefix=google \ --with-boost-python=boost_python313 cd _BUILD && ../configure --build=x86_64-linux-gnu --prefix=/usr --includedir=\${prefix}/include --mandir=\${prefix}/share/man --infodir=\${prefix}/share/info --sysconfdir=/etc --localstatedir=/var --disable-option-checking --disable-silent-rules --libdir=\${prefix}/lib/x86_64-linux-gnu --runstatedir=/run --disable-maintainer-mode --disable-dependency-tracking --with-sparsehash-prefix=google --with-boost-python=boost_python313 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... no checking for mawk... mawk checking whether make sets $(MAKE)... yes checking whether make supports nested variables... yes checking how to create a pax tar archive... gnutar checking whether make supports nested variables... (cached) yes checking whether make supports the include directive... yes (GNU style) 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 gcc understands -c and -o together... yes checking dependency style of gcc... none 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 wchar.h... yes checking for minix/config.h... no checking whether it is safe to define __EXTENSIONS__... yes checking whether _XOPEN_SOURCE should be defined... no checking for library containing strerror... none required checking for g++... g++ checking whether the compiler supports GNU C++... yes checking whether g++ accepts -g... yes checking for g++ option to enable C++11 features... none needed checking dependency style of g++... none checking how to print strings... printf checking for a sed that does not truncate output... /usr/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 how to convert x86_64-pc-linux-gnu file names to x86_64-pc-linux-gnu format... func_convert_file_noop checking how to convert x86_64-pc-linux-gnu file names to toolchain format... func_convert_file_noop checking for /usr/bin/ld option to reload object files... -r checking for file... file 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 ranlib... ranlib checking for ar... ar checking for archiver @FILE support... @ checking for strip... strip 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... no checking if : is a manifest tool... no 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 whether -lc should be explicitly linked in... no checking dynamic linker characteristics... GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking whether stripping libraries is possible... yes checking if libtool supports shared libraries... yes checking whether to build shared libraries... yes checking whether to build static libraries... no checking how to run the C++ preprocessor... g++ -E checking for ld used by g++... /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++ linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking for g++ option to produce PIC... -fPIC -DPIC checking if g++ PIC flag -fPIC -DPIC works... yes checking if g++ static flag -static works... yes checking if g++ supports -c -o file.o... yes checking if g++ supports -c -o file.o... (cached) yes checking whether the g++ 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 for pkg-config... /usr/bin/pkg-config checking pkg-config is at least version 0.9.0... yes checking whether g++ supports C++17 features with -std=gnu++17... yes checking whether to enable debug info... no checking whether to enable parallel algorithms with openmp... checking for OpenMP flag of C++ compiler... -fopenmp checking whether to enable cairo drawing... yes checking for expat... yes checking for a Python interpreter with version >= 3.6... python3 checking for python3... /usr/bin/python3 checking for python3 version... 3.13 checking for python3 platform... linux checking for GNU default python3 prefix... ${prefix} checking for GNU default python3 exec_prefix... ${exec_prefix} checking for python3 script directory (pythondir)... ${PYTHON_PREFIX}/lib/python3.13/site-packages checking for python3 extension module directory (pyexecdir)... ${PYTHON_EXEC_PREFIX}/lib/python3.13/site-packages checking for python3.13... (cached) /usr/bin/python3 checking for a version of Python >= '2.1.0'... yes checking for a version of Python == '3.13.1'... yes checking for the sysconfig Python package... yes checking for Python include path... -I/usr/include/python3.13 checking for Python library path... -L/usr/lib/x86_64-linux-gnu -lpython3.13 checking for Python site-packages path... /usr/lib/python3.13/dist-packages checking for Python platform specific site-packages path... /usr/lib/python3.13/site-packages checking python extra libraries... -ldl -lm checking python extra linking flags... -Xlinker -export-dynamic -Wl,-O1 -Wl,-Bsymbolic-functions checking consistency of all components of python development environment... yes checking for boostlib >= 1.58.0 (105800)... yes checking whether the Boost::Python library is available... yes checking whether boost_python313 is the correct library... yes checking whether the Boost::IOStreams library is available... yes checking for exit in -lboost_iostreams... yes checking whether the Boost::Regex library is available... yes checking for exit in -lboost_regex... yes checking whether the Boost::Context library is available... yes checking for exit in -lboost_context... yes checking whether the Boost::Coroutine library is available... yes checking for exit in -lboost_coroutine... yes checking whether the Boost::Graph library is available... yes checking for exit in -lboost_graph... yes checking whether the Boost::Thread library is available... yes checking for exit in -lboost_thread... yes checking for __gmpz_init in -lgmp... yes checking for __gmpz_init in -lgmp... (cached) yes checking whether CGAL is available in /usr... yes checking whether to enable debbuging with valgrind... no checking python3 module: numpy... yes checking for numpy/arrayobject.h... yes checking for cairomm-1.16... no checking for cairomm-1.0... yes checking python3 module: cairo... yes checking for py3cairo.h... yes checking whether to enable sparsehash... yes checking for libsparsehash... yes checking for google/dense_hash_set... yes configure: pkgconfig directory is ${libdir}/pkgconfig checking our pkgconfig libname... graph-tool-py3.13 checking our pkgconfig version... 2.77 checking our pkgconfig_libdir... ${libdir}/pkgconfig expanded our pkgconfig_libdir... /usr/lib/x86_64-linux-gnu/pkgconfig checking our pkgconfig_libfile... graph-tool-py3.13.pc checking our package / suffix... graph-tool / checking our pkgconfig description... graph-tool Python library checking our pkgconfig requires... checking our pkgconfig ext libs... -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_python313 checking our pkgconfig cppflags... -I/usr/lib/python3.13/dist-packages/graph_tool/include -I/usr/lib/python3.13/dist-packages/graph_tool/include/boost-workaround -I/usr/lib/python3.13/dist-packages/graph_tool/include/pcg-cpp -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include checking our pkgconfig ldflags... noninstalled pkgconfig -L /build/reproducible-path/graph-tool-2.77+ds/_BUILD/.libs noninstalled pkgconfig -I /build/reproducible-path/graph-tool-2.77+ds/_BUILD/.. 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 config.status: executing graph-tool-py3.13.pc commands config.status: creating graph-tool-py3.13.pc.in config.status: creating graph-tool-py3.13.pc config.status: creating graph-tool-py3.13-uninstalled.pc config.status: creating graph-tool-py3.13-uninstalled.sh tput: unknown terminal "unknown" tput: unknown terminal "unknown" ================================================================================ tput: unknown terminal "unknown" tput: unknown terminal "unknown" CONFIGURATION SUMMARY tput: unknown terminal "unknown" tput: unknown terminal "unknown" ================================================================================ tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Using python version: 3.13.1 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Python interpreter: /usr/bin/python3 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Installation path: /usr/lib/python3.13/dist-packages/graph_tool tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" C++ compiler (CXX): g++ -std=gnu++17 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" C++ compiler version: 14 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Prefix: /usr tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Pkgconfigdir: ${libdir}/pkgconfig tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Python CPP flags: -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Python LD flags: -L/usr/lib/x86_64-linux-gnu -lpython3.13 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Boost CPP flags: -pthread -I/usr/include tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Boost LD flags: -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Numpy CPP flags: -I/usr/lib/python3/dist-packages/numpy/core/include tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Sparsehash CPP flags: tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" CGAL CPP flags: -I/usr/include tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" CGAL LD flags: tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Expat CPP flags: tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Expat LD flags: -lexpat tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Cairomm CPP flags: -I/usr/include/cairomm-1.0 -I/usr/lib/x86_64-linux-gnu/cairomm-1.0/include -I/usr/include/sigc++-2.0 -I/usr/lib/x86_64-linux-gnu/sigc++-2.0/include -I/usr/include/cairo -I/usr/include/libpng16 -I/usr/include/freetype2 -I/usr/include/pixman-1 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Cairomm LD flags: -lcairomm-1.0 -lsigc-2.0 -lcairo tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" OpenMP compiler flags: -fopenmp tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" OpenMP LD flags: tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Extra CPPFLAGS: -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Extra CXXFLAGS: -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection tput: unknown terminal "unknown" tput: unknown terminal "unknown" tput: unknown terminal "unknown" Extra LDFLAGS: -Wl,-z,relro -Wl,-z,now tput: unknown terminal "unknown" Using OpenMP: tput: unknown terminal "unknown" tput: unknown terminal "unknown" yes tput: unknown terminal "unknown" Using sparsehash: tput: unknown terminal "unknown" tput: unknown terminal "unknown" yes tput: unknown terminal "unknown" Using cairo: tput: unknown terminal "unknown" tput: unknown terminal "unknown" yes tput: unknown terminal "unknown" tput: unknown terminal "unknown" ================================================================================ make[1]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds' rm -f debian/graph-tool-doc.debhelper.log debian/python3-graph-tool.debhelper.log debian/rules override_dh_auto_build make[1]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds' sh debian/show-mem-swap-nproc =========================== MemAvailable: 22410796 kB SwapFree: 25117044 kB nproc: 12 =========================== dh_auto_build --max-parallel=4 cd _BUILD && make -j4 make[2]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' make all-am make[3]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/epidemics/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/epidemics/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/epidemics/base_vec.cc /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/cising_glauber/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/cising_glauber/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/cising_glauber/base_vec.cc /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/ising_glauber/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/ising_glauber/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/ising_glauber/base_vec.cc /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/pseudo_cising/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/pseudo_cising/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/pseudo_cising/base_vec.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/epidemics/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/epidemics/.libs/libgraph_tool_inference_fast_la-base_vec.o libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/pseudo_cising/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/pseudo_cising/.libs/libgraph_tool_inference_fast_la-base_vec.o libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/ising_glauber/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/ising_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/cising_glauber/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/cising_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../dynamics_discrete.hh:28, from ../src/graph/inference/uncertain/dynamics/ising_glauber/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/ising_glauber/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/epidemics/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/epidemics/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/epidemics/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/epidemics/../dynamics_discrete.hh:28, from ../src/graph/inference/uncertain/dynamics/epidemics/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/epidemics/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/cising_glauber/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/cising_glauber/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/pseudo_ising/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/pseudo_ising/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/pseudo_ising/base_vec.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/pseudo_ising/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/pseudo_ising/.libs/libgraph_tool_inference_fast_la-base_vec.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/pseudo_normal/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/pseudo_normal/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/pseudo_normal/base_vec.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/pseudo_normal/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/pseudo_normal/.libs/libgraph_tool_inference_fast_la-base_vec.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/linear_normal/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/linear_normal/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/linear_normal/base_vec.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/linear_normal/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/linear_normal/.libs/libgraph_tool_inference_fast_la-base_vec.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/lotka_volterra/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/lotka_volterra/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/lotka_volterra/base_vec.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/lotka_volterra/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/lotka_volterra/.libs/libgraph_tool_inference_fast_la-base_vec.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../dynamics_discrete.hh:28, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/linear_normal/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/linear_normal/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/linear_normal/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/linear_normal/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/linear_normal/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/linear_normal/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/normal_glauber/libgraph_tool_inference_fast_la-base_vec.lo `test -f 'src/graph/inference/uncertain/dynamics/normal_glauber/base_vec.cc' || echo '../'`src/graph/inference/uncertain/dynamics/normal_glauber/base_vec.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/normal_glauber/base_vec.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/normal_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include/cairomm-1.0 -I/usr/lib/x86_64-linux-gnu/cairomm-1.0/include -I/usr/include/sigc++-2.0 -I/usr/lib/x86_64-linux-gnu/sigc++-2.0/include -I/usr/include/cairo -I/usr/include/libpng16 -I/usr/include/freetype2 -I/usr/include/pixman-1 -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/draw/libgt_pycairo_aux_la-pycairo_aux.lo `test -f 'src/graph/draw/pycairo_aux.cc' || echo '../'`src/graph/draw/pycairo_aux.cc /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_betweenness.lo ../src/graph/centrality/graph_betweenness.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include/cairomm-1.0 -I/usr/lib/x86_64-linux-gnu/cairomm-1.0/include -I/usr/include/sigc++-2.0 -I/usr/lib/x86_64-linux-gnu/sigc++-2.0/include -I/usr/include/cairo -I/usr/include/libpng16 -I/usr/include/freetype2 -I/usr/include/pixman-1 -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/draw/pycairo_aux.cc -fPIC -DPIC -o src/graph/draw/.libs/libgt_pycairo_aux_la-pycairo_aux.o libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_betweenness.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_betweenness.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_centrality_bind.lo ../src/graph/centrality/graph_centrality_bind.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_centrality_bind.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_centrality_bind.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_closeness.lo ../src/graph/centrality/graph_closeness.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_closeness.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_closeness.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/normal_glauber/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/normal_glauber/base_vec.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_eigentrust.lo ../src/graph/centrality/graph_eigentrust.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_eigentrust.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_eigentrust.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_eigenvector.lo ../src/graph/centrality/graph_eigenvector.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_eigenvector.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_eigenvector.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_hits.lo ../src/graph/centrality/graph_hits.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_hits.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_hits.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_katz.lo ../src/graph/centrality/graph_katz.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_katz.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_katz.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_pagerank.lo ../src/graph/centrality/graph_pagerank.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_pagerank.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_pagerank.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/centrality/graph_trust_transitivity.lo ../src/graph/centrality/graph_trust_transitivity.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/centrality/graph_trust_transitivity.cc -fPIC -DPIC -o src/graph/centrality/.libs/graph_trust_transitivity.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/clustering/graph_clustering.lo ../src/graph/clustering/graph_clustering.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/clustering/graph_clustering.cc -fPIC -DPIC -o src/graph/clustering/.libs/graph_clustering.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/clustering/../generation/sampler.hh:21, from ../src/graph/clustering/graph_clustering.hh:24, from ../src/graph/clustering/graph_clustering.cc:24: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/clustering/graph_extended_clustering.lo ../src/graph/clustering/graph_extended_clustering.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/clustering/graph_extended_clustering.cc -fPIC -DPIC -o src/graph/clustering/.libs/graph_extended_clustering.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/clustering/graph_motifs.lo ../src/graph/clustering/graph_motifs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/clustering/graph_motifs.cc -fPIC -DPIC -o src/graph/clustering/.libs/graph_motifs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/clustering/graph_motifs.hh:26, from ../src/graph/clustering/graph_motifs.cc:24: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/base64.lo ../src/graph/base64.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/base64.cc -fPIC -DPIC -o src/graph/.libs/base64.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/demangle.lo ../src/graph/demangle.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/demangle.cc -fPIC -DPIC -o src/graph/.libs/demangle.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph.lo ../src/graph/graph.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph.cc -fPIC -DPIC -o src/graph/.libs/graph.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_exceptions.lo ../src/graph/graph_exceptions.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_exceptions.cc -fPIC -DPIC -o src/graph/.libs/graph_exceptions.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_bind.lo ../src/graph/graph_bind.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_bind.cc -fPIC -DPIC -o src/graph/.libs/graph_bind.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_copy.lo ../src/graph/graph_copy.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_copy.cc -fPIC -DPIC -o src/graph/.libs/graph_copy.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/graph_bind.cc:26: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_filtering.lo ../src/graph/graph_filtering.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_filtering.cc -fPIC -DPIC -o src/graph/.libs/graph_filtering.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_io.lo ../src/graph/graph_io.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_io.cc -fPIC -DPIC -o src/graph/.libs/graph_io.o In file included from ../src/graph/graph.hh:33, from ../src/graph/graph_bind.cc:18: In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'vector_from_list::construct(PyObject*, boost::python::converter::rvalue_from_python_stage1_data*)::' at ../src/graph/graph_bind.cc:88:37, inlined from 'static void vector_from_list::construct(PyObject*, boost::python::converter::rvalue_from_python_stage1_data*) [with ValueType = boost::any]' at ../src/graph/graph_bind.cc:111:22: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ In file included from /usr/include/boost/python.hpp:66, from ../src/graph/numpy_bind.hh:22, from ../src/graph/graph_bind.cc:22: /usr/include/boost/python/stl_iterator.hpp: In static member function 'static void vector_from_list::construct(PyObject*, boost::python::converter::rvalue_from_python_stage1_data*) [with ValueType = boost::any]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from ../src/graph/graph.hh:33, from ../src/graph/graph_copy.cc:18: In copy constructor 'boost::any::any(const boost::any&)', inlined from 'graph_tool::GraphInterface::GraphInterface(const graph_tool::GraphInterface&, bool, boost::python::api::object, boost::python::api::object, boost::python::api::object)' at ../src/graph/graph_copy.cc:282:62: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ ../src/graph/graph_copy.cc: In constructor 'graph_tool::GraphInterface::GraphInterface(const graph_tool::GraphInterface&, bool, boost::python::api::object, boost::python::api::object, boost::python::api::object)': ../src/graph/graph_copy.cc:282:60: note: '' declared here 282 | boost::any avorder = python::extract(vorder)(); | ^ In file included from ../src/graph/graph.hh:42: ../src/graph/graph_properties.hh: In member function 'const std::string& graph_tool::get_type_name::operator()(const std::type_info&) const [with TypeSequence = boost::mpl::vector15, std::vector, std::vector, std::vector, std::vector, std::vector, std::vector, std::vector >, boost::python::api::object>; NamedSequence = boost::mpl::vector15, std::vector, std::vector, std::vector, std::vector, std::vector, std::vector, std::vector >, boost::python::api::object>]': ../src/graph/graph_properties.hh:197:17: warning: 'name' may be used uninitialized [-Wmaybe-uninitialized] 197 | return *name; | ^~~~ ../src/graph/graph_properties.hh:194:28: note: 'name' was declared here 194 | std::string const* name; | ^~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_openmp.lo ../src/graph/graph_openmp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_openmp.cc -fPIC -DPIC -o src/graph/.libs/graph_openmp.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties.lo ../src/graph/graph_properties.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties.cc -fPIC -DPIC -o src/graph/.libs/graph_properties.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_imp1.lo ../src/graph/graph_properties_imp1.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_imp1.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_imp1.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_imp2.lo ../src/graph/graph_properties_imp2.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_imp2.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_imp2.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_imp3.lo ../src/graph/graph_properties_imp3.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_imp3.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_imp3.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_imp4.lo ../src/graph/graph_properties_imp4.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_imp4.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_imp4.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_copy.lo ../src/graph/graph_properties_copy.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_copy.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_copy.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_copy_imp1.lo ../src/graph/graph_properties_copy_imp1.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_copy_imp1.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_copy_imp1.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_group.lo ../src/graph/graph_properties_group.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_group.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_group.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_ungroup.lo ../src/graph/graph_properties_ungroup.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_ungroup.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_ungroup.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_map_values.lo ../src/graph/graph_properties_map_values.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_map_values.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_map_values.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_properties_map_values_imp1.lo ../src/graph/graph_properties_map_values_imp1.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_properties_map_values_imp1.cc -fPIC -DPIC -o src/graph/.libs/graph_properties_map_values_imp1.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_python_interface.lo ../src/graph/graph_python_interface.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_python_interface.cc -fPIC -DPIC -o src/graph/.libs/graph_python_interface.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_python_interface_imp1.lo ../src/graph/graph_python_interface_imp1.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_python_interface_imp1.cc -fPIC -DPIC -o src/graph/.libs/graph_python_interface_imp1.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_python_interface_export.lo ../src/graph/graph_python_interface_export.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_python_interface_export.cc -fPIC -DPIC -o src/graph/.libs/graph_python_interface_export.o In file included from ../src/graph/graph.hh:33, from ../src/graph/graph_filtering.hh:21, from ../src/graph/graph_python_interface_imp1.cc:18: In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ In file included from /usr/include/boost/python.hpp:66, from ../src/graph/gil_release.hh:21, from ../src/graph/graph_filtering.hh:35: /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:253:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::numpy_dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::adj_list; VProp = boost::checked_vector_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::undirected_adaptor >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/graph_python_interface.cc:21: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16, inlined from 'boost::coroutines2::detail::pull_coroutine::~pull_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_coroutine.ipp:64:24, inlined from 'constexpr void std::_Destroy(_Tp*) [with _Tp = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/stl_construct.h:151:22, inlined from 'static void std::allocator_traits >::destroy(allocator_type&, _Up*) [with _Up = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/alloc_traits.h:720:17, inlined from 'void std::_Sp_counted_ptr_inplace<_Tp, _Alloc, _Lp>::_M_dispose() [with _Tp = boost::coroutines2::detail::pull_coroutine; _Alloc = std::allocator; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:616:35: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)MEM[(struct pull_coroutine *)this_2(D) + 16B].cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]' at ../src/graph/graph_python_interface_imp1.cc:308:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_hash::dispatch(Graph&, boost::python::api::object&, VProp&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VProp = boost::checked_vector_property_map, boost::typed_identity_property_map >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_iter::operator()(Graph&, boost::python::api::object&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >]' at ../src/graph/graph_python_interface_imp1.cc:140:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_iter::operator()(Graph&, boost::python::api::object&, boost::python::api::object&) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_iter::operator()(Graph&, boost::python::api::object&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >]' at ../src/graph/graph_python_interface_imp1.cc:140:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_iter::operator()(Graph&, boost::python::api::object&, boost::python::api::object&) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'ValueT boost::python::stl_input_iterator::dereference() const [with ValueT = boost::any]' at /usr/include/boost/python/stl_iterator.hpp:48:61, inlined from 'static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::python::stl_input_iterator]' at /usr/include/boost/iterator/iterator_facade.hpp:631:32, inlined from 'boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::python::stl_input_iterator; Value = boost::any; CategoryOrTraversal = std::input_iterator_tag; Reference = boost::any; Difference = long int]' at /usr/include/boost/iterator/iterator_facade.hpp:737:69, inlined from 'void graph_tool::add_edge_list_iter::operator()(Graph&, boost::python::api::object&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >]' at ../src/graph/graph_python_interface_imp1.cc:140:33: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ /usr/include/boost/python/stl_iterator.hpp: In function 'void graph_tool::add_edge_list_iter::operator()(Graph&, boost::python::api::object&, boost::python::api::object&) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >]': /usr/include/boost/python/stl_iterator.hpp:48:16: note: '' declared here 48 | return extract(this->impl_.current().get())(); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graph_selectors.lo ../src/graph/graph_selectors.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graph_selectors.cc -fPIC -DPIC -o src/graph/.libs/graph_selectors.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/graphml.lo ../src/graph/graphml.cpp libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/graphml.cpp -fPIC -DPIC -o src/graph/.libs/graphml.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/openmp.lo ../src/graph/openmp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/openmp.cc -fPIC -DPIC -o src/graph/.libs/openmp.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/random.lo ../src/graph/random.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/random.cc -fPIC -DPIC -o src/graph/.libs/random.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/random.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/read_graphviz_new.lo ../src/graph/read_graphviz_new.cpp libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/read_graphviz_new.cpp -fPIC -DPIC -o src/graph/.libs/read_graphviz_new.o In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_assortativity.lo ../src/graph/correlations/graph_assortativity.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_assortativity.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_assortativity.o In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_correlations.lo ../src/graph/correlations/graph_correlations.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_correlations.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_correlations.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_correlations_imp1.lo ../src/graph/correlations/graph_correlations_imp1.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_correlations_imp1.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_correlations_imp1.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_avg_correlations.lo ../src/graph/correlations/graph_avg_correlations.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_avg_correlations.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_avg_correlations.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_avg_correlations_imp1.lo ../src/graph/correlations/graph_avg_correlations_imp1.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_avg_correlations_imp1.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_avg_correlations_imp1.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_avg_correlations_combined.lo ../src/graph/correlations/graph_avg_correlations_combined.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_avg_correlations_combined.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_avg_correlations_combined.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_correlations_combined.lo ../src/graph/correlations/graph_correlations_combined.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_correlations_combined.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_correlations_combined.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/correlations/graph_correlations_bind.lo ../src/graph/correlations/graph_correlations_bind.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/correlations/graph_correlations_bind.cc -fPIC -DPIC -o src/graph/correlations/.libs/graph_correlations_bind.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include/cairomm-1.0 -I/usr/lib/x86_64-linux-gnu/cairomm-1.0/include -I/usr/include/sigc++-2.0 -I/usr/lib/x86_64-linux-gnu/sigc++-2.0/include -I/usr/include/cairo -I/usr/include/libpng16 -I/usr/include/freetype2 -I/usr/include/pixman-1 -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/draw/libgraph_tool_draw_la-graph_cairo_draw.lo `test -f 'src/graph/draw/graph_cairo_draw.cc' || echo '../'`src/graph/draw/graph_cairo_draw.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include/cairomm-1.0 -I/usr/lib/x86_64-linux-gnu/cairomm-1.0/include -I/usr/include/sigc++-2.0 -I/usr/lib/x86_64-linux-gnu/sigc++-2.0/include -I/usr/include/cairo -I/usr/include/libpng16 -I/usr/include/freetype2 -I/usr/include/pixman-1 -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/draw/graph_cairo_draw.cc -fPIC -DPIC -o src/graph/draw/.libs/libgraph_tool_draw_la-graph_cairo_draw.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include/cairomm-1.0 -I/usr/lib/x86_64-linux-gnu/cairomm-1.0/include -I/usr/include/sigc++-2.0 -I/usr/lib/x86_64-linux-gnu/sigc++-2.0/include -I/usr/include/cairo -I/usr/include/libpng16 -I/usr/include/freetype2 -I/usr/include/pixman-1 -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/draw/libgraph_tool_draw_la-graph_tree_cts.lo `test -f 'src/graph/draw/graph_tree_cts.cc' || echo '../'`src/graph/draw/graph_tree_cts.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include/cairomm-1.0 -I/usr/lib/x86_64-linux-gnu/cairomm-1.0/include -I/usr/include/sigc++-2.0 -I/usr/lib/x86_64-linux-gnu/sigc++-2.0/include -I/usr/include/cairo -I/usr/include/libpng16 -I/usr/include/freetype2 -I/usr/include/pixman-1 -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/draw/graph_tree_cts.cc -fPIC -DPIC -o src/graph/draw/.libs/libgraph_tool_draw_la-graph_tree_cts.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/dynamics/graph_continuous.lo ../src/graph/dynamics/graph_continuous.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/dynamics/graph_continuous.cc -fPIC -DPIC -o src/graph/dynamics/.libs/graph_continuous.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/dynamics/graph_continuous.hh:27, from ../src/graph/dynamics/graph_continuous.cc:26: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/draw/graph_cairo_draw.cc:35: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/dynamics/graph_discrete.lo ../src/graph/dynamics/graph_discrete.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/dynamics/graph_discrete.cc -fPIC -DPIC -o src/graph/dynamics/.libs/graph_discrete.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/dynamics/graph_discrete.hh:27, from ../src/graph/dynamics/graph_discrete.cc:27: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/dynamics/graph_dynamics.lo ../src/graph/dynamics/graph_dynamics.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/dynamics/graph_dynamics.cc -fPIC -DPIC -o src/graph/dynamics/.libs/graph_dynamics.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/dynamics/graph_normal_bp.lo ../src/graph/dynamics/graph_normal_bp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/dynamics/graph_normal_bp.cc -fPIC -DPIC -o src/graph/dynamics/.libs/graph_normal_bp.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/dynamics/graph_normal_bp.hh:24, from ../src/graph/dynamics/graph_normal_bp.cc:27: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/dynamics/graph_potts_bp.lo ../src/graph/dynamics/graph_potts_bp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/dynamics/graph_potts_bp.cc -fPIC -DPIC -o src/graph/dynamics/.libs/graph_potts_bp.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/dynamics/graph_potts_bp.hh:24, from ../src/graph/dynamics/graph_potts_bp.cc:27: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/flow/graph_edmonds_karp.lo ../src/graph/flow/graph_edmonds_karp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/flow/graph_edmonds_karp.cc -fPIC -DPIC -o src/graph/flow/.libs/graph_edmonds_karp.o In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, cairo_draw(graph_tool::GraphInterface&, boost::any, boost::any, boost::any, bool, boost::python::dict, boost::python::dict, boost::python::dict, boost::python::dict, double, int64_t, boost::python::api::object)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/flow/graph_push_relabel.lo ../src/graph/flow/graph_push_relabel.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/flow/graph_push_relabel.cc -fPIC -DPIC -o src/graph/flow/.libs/graph_push_relabel.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/flow/graph_kolmogorov.lo ../src/graph/flow/graph_kolmogorov.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/flow/graph_kolmogorov.cc -fPIC -DPIC -o src/graph/flow/.libs/graph_kolmogorov.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/flow/graph_minimum_cut.lo ../src/graph/flow/graph_minimum_cut.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/flow/graph_minimum_cut.cc -fPIC -DPIC -o src/graph/flow/.libs/graph_minimum_cut.o In file included from /usr/include/boost/tuple/tuple.hpp:28, from /usr/include/boost/graph/graph_traits.hpp:16, from ../src/graph/graph_adjacency.hh:25, from ../src/graph/graph.hh:35, from ../src/graph/graph_filtering.hh:21, from ../src/graph/flow/graph_minimum_cut.cc:18: In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const long double; HT = long double]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long double; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const long double; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long double; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long double]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ In file included from ../src/graph/flow/graph_minimum_cut.cc:23: ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const short int; HT = short int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const short int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const short int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = short int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = short int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const int; HT = int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const long double; HT = long double]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long double; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const long double; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long double; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long double]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const long unsigned int; HT = long unsigned int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const long unsigned int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long unsigned int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long unsigned int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = graph_tool::UnityPropertyMap >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = graph_tool::UnityPropertyMap >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const long int; HT = long int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const long int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const double; HT = double]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const double; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const double; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = double; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = double]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const unsigned char; HT = unsigned char]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const unsigned char; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const unsigned char; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = unsigned char; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = unsigned char]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/flow/graph_flow_bind.lo ../src/graph/flow/graph_flow_bind.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/flow/graph_flow_bind.cc -fPIC -DPIC -o src/graph/flow/.libs/graph_flow_bind.o In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const long unsigned int; HT = long unsigned int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const long unsigned int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long unsigned int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long unsigned int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = graph_tool::UnityPropertyMap >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = graph_tool::UnityPropertyMap >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const unsigned char; HT = unsigned char]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const unsigned char; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const unsigned char; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = unsigned char; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = unsigned char]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const long int; HT = long int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const long int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = long int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_community_network.lo `test -f 'src/graph/generation/graph_community_network.cc' || echo '../'`src/graph/generation/graph_community_network.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_community_network.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network.o In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const double; HT = double]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const double; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const double; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = double; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = double]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const short int; HT = short int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const short int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const short int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = short int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = short int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ In constructor 'boost::tuples::cons::cons(T1&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&, const boost::tuples::null_type&) [with T1 = const int; HT = int]', inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const int; T3 = const boost::tuples::null_type; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::cons::cons(T1&, T2&, T3&, T4&, T5&, T6&, T7&, T8&, T9&, T10&) [with T1 = const long unsigned int; T2 = const long unsigned int; T3 = const int; T4 = const boost::tuples::null_type; T5 = const boost::tuples::null_type; T6 = const boost::tuples::null_type; T7 = const boost::tuples::null_type; T8 = const boost::tuples::null_type; T9 = const boost::tuples::null_type; T10 = const boost::tuples::null_type; HT = long unsigned int; TT = boost::tuples::cons >]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:303:7, inlined from 'boost::tuples::tuple::tuple(typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type, typename boost::tuples::access_traits::parameter_type) [with T0 = long unsigned int; T1 = long unsigned int; T2 = int; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:508:49, inlined from 'typename boost::tuples::detail::make_tuple_mapper::type boost::tuples::make_tuple(const T0&, const T1&, const T2&) [with T0 = long unsigned int; T1 = long unsigned int; T2 = int]' at /usr/include/boost/tuple/detail/tuple_basic.hpp:764:22, inlined from 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]' at ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:113:39: /usr/include/boost/tuple/detail/tuple_basic.hpp:386:5: warning: 'w' may be used uninitialized [-Wmaybe-uninitialized] 386 | : head (t1) {} | ^~~~~~~~~ ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp: In function 'boost::tuples::tuple::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, typename boost::property_traits::value_type> boost::detail::stoer_wagner_phase(const UndirectedGraph&, VertexAssignmentMap, const std::set::vertex_descriptor>&, WeightMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::undirected_adaptor >; VertexAssignmentMap = boost::shared_array_property_map >; WeightMap = boost::unchecked_vector_property_map >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect >, boost::shared_array_property_map >, std::greater, std::vector >]': ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp:79:19: note: 'w' was declared here 79 | weight_type w; | ^ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_community_network_eavg.lo `test -f 'src/graph/generation/graph_community_network_eavg.cc' || echo '../'`src/graph/generation/graph_community_network_eavg.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_community_network_eavg.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_eavg.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_community_network_eavg_imp1.lo `test -f 'src/graph/generation/graph_community_network_eavg_imp1.cc' || echo '../'`src/graph/generation/graph_community_network_eavg_imp1.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_community_network_eavg_imp1.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_eavg_imp1.o In file included from ../src/graph/graph.hh:33, from ../src/graph/generation/graph_community_network_eavg.cc:18: In copy constructor 'boost::any::any(const boost::any&)', inlined from 'void community_network_eavg(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::python::list, bool, bool)' at ../src/graph/generation/graph_community_network_eavg.cc:82:72: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ ../src/graph/generation/graph_community_network_eavg.cc: In function 'void community_network_eavg(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::python::list, bool, bool)': ../src/graph/generation/graph_community_network_eavg.cc:82:70: note: '' declared here 82 | boost::any ceprop = boost::python::extract(aeprops[i][2])(); | ^ In copy constructor 'boost::any::any(const boost::any&)', inlined from 'void community_network_eavg(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::python::list, bool, bool)' at ../src/graph/generation/graph_community_network_eavg.cc:80:71: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ ../src/graph/generation/graph_community_network_eavg.cc: In function 'void community_network_eavg(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::python::list, bool, bool)': ../src/graph/generation/graph_community_network_eavg.cc:80:69: note: '' declared here 80 | boost::any eprop = boost::python::extract(aeprops[i][0])(); | ^ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_community_network_edges.lo `test -f 'src/graph/generation/graph_community_network_edges.cc' || echo '../'`src/graph/generation/graph_community_network_edges.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_community_network_edges.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_edges.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_community_network_vavg.lo `test -f 'src/graph/generation/graph_community_network_vavg.cc' || echo '../'`src/graph/generation/graph_community_network_vavg.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_community_network_vavg.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_vavg.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_complete.lo `test -f 'src/graph/generation/graph_complete.cc' || echo '../'`src/graph/generation/graph_complete.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_complete.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_complete.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_contract_edges.lo `test -f 'src/graph/generation/graph_contract_edges.cc' || echo '../'`src/graph/generation/graph_contract_edges.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_contract_edges.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_contract_edges.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/graph_contract_edges.hh:23, from ../src/graph/generation/graph_contract_edges.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_generation.lo `test -f 'src/graph/generation/graph_generation.cc' || echo '../'`src/graph/generation/graph_generation.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_generation.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_generation.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/graph_generation.hh:26, from ../src/graph/generation/graph_generation.cc:27: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_geometric.lo `test -f 'src/graph/generation/graph_geometric.cc' || echo '../'`src/graph/generation/graph_geometric.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_geometric.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_geometric.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_knn.lo `test -f 'src/graph/generation/graph_knn.cc' || echo '../'`src/graph/generation/graph_knn.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_knn.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_knn.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/generation/graph_knn.hh:30, from ../src/graph/generation/graph_knn.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_lattice.lo `test -f 'src/graph/generation/graph_lattice.cc' || echo '../'`src/graph/generation/graph_lattice.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_lattice.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_lattice.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_line_graph.lo `test -f 'src/graph/generation/graph_line_graph.cc' || echo '../'`src/graph/generation/graph_line_graph.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_line_graph.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_line_graph.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_maxent_sbm.lo `test -f 'src/graph/generation/graph_maxent_sbm.cc' || echo '../'`src/graph/generation/graph_maxent_sbm.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_maxent_sbm.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_maxent_sbm.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/sampler.hh:21, from ../src/graph/generation/graph_maxent_sbm.hh:26, from ../src/graph/generation/graph_maxent_sbm.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_parallel.lo `test -f 'src/graph/generation/graph_parallel.cc' || echo '../'`src/graph/generation/graph_parallel.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_parallel.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_parallel.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_predecessor.lo `test -f 'src/graph/generation/graph_predecessor.cc' || echo '../'`src/graph/generation/graph_predecessor.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_predecessor.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_predecessor.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_price.lo `test -f 'src/graph/generation/graph_price.cc' || echo '../'`src/graph/generation/graph_price.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_price.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_price.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/graph_price.hh:23, from ../src/graph/generation/graph_price.cc:21: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_random_edges.lo `test -f 'src/graph/generation/graph_random_edges.cc' || echo '../'`src/graph/generation/graph_random_edges.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_random_edges.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_random_edges.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_rewiring.lo `test -f 'src/graph/generation/graph_rewiring.cc' || echo '../'`src/graph/generation/graph_rewiring.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_rewiring.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_rewiring.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/graph_random_edges.hh:23, from ../src/graph/generation/graph_random_edges.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/sampler.hh:21, from ../src/graph/generation/graph_rewiring.hh:27, from ../src/graph/generation/graph_rewiring.cc:23: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_sbm.lo `test -f 'src/graph/generation/graph_sbm.cc' || echo '../'`src/graph/generation/graph_sbm.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_sbm.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_sbm.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/sampler.hh:21, from ../src/graph/generation/graph_sbm.hh:24, from ../src/graph/generation/graph_sbm.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_triadic_closure.lo `test -f 'src/graph/generation/graph_triadic_closure.cc' || echo '../'`src/graph/generation/graph_triadic_closure.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_triadic_closure.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_triadic_closure.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/generation/sampler.hh:21, from ../src/graph/generation/graph_triadic_closure.hh:27, from ../src/graph/generation/graph_triadic_closure.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_triangulation.lo `test -f 'src/graph/generation/graph_triangulation.cc' || echo '../'`src/graph/generation/graph_triangulation.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_triangulation.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_triangulation.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_union.lo `test -f 'src/graph/generation/graph_union.cc' || echo '../'`src/graph/generation/graph_union.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_union.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_union.o In file included from ../src/graph/graph.hh:33, from ../src/graph/generation/graph_community_network_vavg.cc:18: In copy constructor 'boost::any::any(const boost::any&)', inlined from 'void community_network_vavg(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::python::list)' at ../src/graph/generation/graph_community_network_vavg.cc:91:71: /usr/include/boost/any.hpp:79:27: warning: '*(const boost::any*)((char*)& + offsetof(boost::python::extract,boost::python::extract::.boost::python::converter::extract_rvalue::m_data.boost::python::converter::rvalue_from_python_data::.boost::python::converter::rvalue_from_python_storage::storage)).boost::any::content' may be used uninitialized [-Wmaybe-uninitialized] 79 | : content(other.content ? other.content->clone() : 0) | ~~~~~~^~~~~~~ ../src/graph/generation/graph_community_network_vavg.cc: In function 'void community_network_vavg(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::python::list)': ../src/graph/generation/graph_community_network_vavg.cc:91:69: note: '' declared here 91 | boost::any vprop = boost::python::extract(avprops[i][0])(); | ^ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_union_eprop.lo `test -f 'src/graph/generation/graph_union_eprop.cc' || echo '../'`src/graph/generation/graph_union_eprop.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_union_eprop.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_union_eprop.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/generation/libgraph_tool_generation_la-graph_union_vprop.lo `test -f 'src/graph/generation/graph_union_vprop.cc' || echo '../'`src/graph/generation/graph_union_vprop.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -I/usr/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/generation/graph_union_vprop.cc -fPIC -DPIC -o src/graph/generation/.libs/libgraph_tool_generation_la-graph_union_vprop.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel.lo ../src/graph/inference/blockmodel/graph_blockmodel.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_em.lo ../src/graph/inference/blockmodel/graph_blockmodel_em.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_em.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_em.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_em.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_exhaustive.lo ../src/graph/inference/blockmodel/graph_blockmodel_exhaustive.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_exhaustive.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_exhaustive.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_exhaustive.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_gibbs.lo ../src/graph/inference/blockmodel/graph_blockmodel_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_gibbs.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_gibbs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_imp.lo ../src/graph/inference/blockmodel/graph_blockmodel_imp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_imp.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_imp.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_imp.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_imp2.lo ../src/graph/inference/blockmodel/graph_blockmodel_imp2.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_imp2.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_imp2.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_imp2.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/inference/blockmodel/../loops/exhaustive_loop.hh:22, from ../src/graph/inference/blockmodel/graph_blockmodel_exhaustive.cc:26: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_imp3.lo ../src/graph/inference/blockmodel/graph_blockmodel_imp3.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_imp3.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_imp3.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_imp3.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_marginals.lo ../src/graph/inference/blockmodel/graph_blockmodel_marginals.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_marginals.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_marginals.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_mcmc.lo ../src/graph/inference/blockmodel/graph_blockmodel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_mcmc.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_multicanonical.lo ../src/graph/inference/blockmodel/graph_blockmodel_multicanonical.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_multicanonical.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_multicanonical.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_multicanonical.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_multicanonical_multiflip.lo ../src/graph/inference/blockmodel/graph_blockmodel_multicanonical_multiflip.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_multicanonical_multiflip.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_multicanonical_multiflip.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_multicanonical_multiflip.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_multiflip_mcmc.lo ../src/graph/inference/blockmodel/graph_blockmodel_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/blockmodel/graph_blockmodel_multilevel_mcmc.lo ../src/graph/inference/blockmodel/graph_blockmodel_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/blockmodel/graph_blockmodel_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/blockmodel/.libs/graph_blockmodel_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/blockmodel/graph_blockmodel_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/cliques/graph_clique_decomposition.lo ../src/graph/inference/cliques/graph_clique_decomposition.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/cliques/graph_clique_decomposition.cc -fPIC -DPIC -o src/graph/inference/cliques/.libs/graph_clique_decomposition.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/cliques/graph_clique_decomposition.cc:20: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/histogram/graph_histogram.lo ../src/graph/inference/histogram/graph_histogram.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/histogram/graph_histogram.cc -fPIC -DPIC -o src/graph/inference/histogram/.libs/graph_histogram.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/histogram/graph_histogram.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/histogram/graph_histogram_mcmc.lo ../src/graph/inference/histogram/graph_histogram_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/histogram/graph_histogram_mcmc.cc -fPIC -DPIC -o src/graph/inference/histogram/.libs/graph_histogram_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/histogram/graph_histogram_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/modularity/graph_modularity.lo ../src/graph/inference/modularity/graph_modularity.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/modularity/graph_modularity.cc -fPIC -DPIC -o src/graph/inference/modularity/.libs/graph_modularity.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/modularity/../blockmodel/../../generation/sampler.hh:21, from ../src/graph/inference/modularity/../blockmodel/graph_blockmodel_elist.hh:21, from ../src/graph/inference/modularity/../blockmodel/graph_blockmodel_util.hh:29, from ../src/graph/inference/modularity/graph_modularity.hh:27, from ../src/graph/inference/modularity/graph_modularity.cc:22: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/modularity/graph_modularity_gibbs.lo ../src/graph/inference/modularity/graph_modularity_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/modularity/graph_modularity_gibbs.cc -fPIC -DPIC -o src/graph/inference/modularity/.libs/graph_modularity_gibbs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/modularity/graph_modularity_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/modularity/graph_modularity_mcmc.lo ../src/graph/inference/modularity/graph_modularity_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/modularity/graph_modularity_mcmc.cc -fPIC -DPIC -o src/graph/inference/modularity/.libs/graph_modularity_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/modularity/graph_modularity_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/modularity/graph_modularity_multiflip_mcmc.lo ../src/graph/inference/modularity/graph_modularity_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/modularity/graph_modularity_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/modularity/.libs/graph_modularity_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/modularity/graph_modularity_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/modularity/graph_modularity_multilevel_mcmc.lo ../src/graph/inference/modularity/graph_modularity_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/modularity/graph_modularity_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/modularity/.libs/graph_modularity_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/modularity/graph_modularity_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/norm_cut/graph_norm_cut.lo ../src/graph/inference/norm_cut/graph_norm_cut.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/norm_cut/graph_norm_cut.cc -fPIC -DPIC -o src/graph/inference/norm_cut/.libs/graph_norm_cut.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/norm_cut/../blockmodel/../../generation/sampler.hh:21, from ../src/graph/inference/norm_cut/../blockmodel/graph_blockmodel_elist.hh:21, from ../src/graph/inference/norm_cut/../blockmodel/graph_blockmodel_util.hh:29, from ../src/graph/inference/norm_cut/graph_norm_cut.hh:27, from ../src/graph/inference/norm_cut/graph_norm_cut.cc:22: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/norm_cut/graph_norm_cut_gibbs.lo ../src/graph/inference/norm_cut/graph_norm_cut_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/norm_cut/graph_norm_cut_gibbs.cc -fPIC -DPIC -o src/graph/inference/norm_cut/.libs/graph_norm_cut_gibbs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/norm_cut/graph_norm_cut_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/norm_cut/graph_norm_cut_mcmc.lo ../src/graph/inference/norm_cut/graph_norm_cut_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/norm_cut/graph_norm_cut_mcmc.cc -fPIC -DPIC -o src/graph/inference/norm_cut/.libs/graph_norm_cut_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/norm_cut/graph_norm_cut_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/norm_cut/graph_norm_cut_multiflip_mcmc.lo ../src/graph/inference/norm_cut/graph_norm_cut_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/norm_cut/graph_norm_cut_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/norm_cut/.libs/graph_norm_cut_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/norm_cut/graph_norm_cut_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/norm_cut/graph_norm_cut_multilevel_mcmc.lo ../src/graph/inference/norm_cut/graph_norm_cut_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/norm_cut/graph_norm_cut_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/norm_cut/.libs/graph_norm_cut_multilevel_mcmc.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid.lo ../src/graph/inference/partition_centroid/graph_partition_centroid.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/norm_cut/graph_norm_cut_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid_mcmc.lo ../src/graph/inference/partition_centroid/graph_partition_centroid_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid_multiflip_mcmc.lo ../src/graph/inference/partition_centroid/graph_partition_centroid_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid_multilevel_mcmc.lo ../src/graph/inference/partition_centroid/graph_partition_centroid_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid_rmi.lo ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid_rmi_mcmc.lo ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multiflip_mcmc.lo ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multilevel_mcmc.lo ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_modes/graph_partition_mode.lo ../src/graph/inference/partition_modes/graph_partition_mode.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_modes/graph_partition_mode.cc -fPIC -DPIC -o src/graph/inference/partition_modes/.libs/graph_partition_mode.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_modes/graph_partition_mode.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_modes/graph_partition_mode_clustering.lo ../src/graph/inference/partition_modes/graph_partition_mode_clustering.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_modes/graph_partition_mode_clustering.cc -fPIC -DPIC -o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_modes/graph_partition_mode_clustering.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/boost/multi_array/storage_order.hpp:18, from /usr/include/boost/multi_array/base.hpp:25, from /usr/include/boost/multi_array.hpp:29, from ../src/graph/numpy_bind.hh:34, from ../src/graph/inference/partition_modes/graph_partition_mode.cc:20: In function 'OutputIter boost::detail::multi_array::copy_n(InputIter, Size, OutputIter) [with InputIter = const long int*; Size = long unsigned int; OutputIter = long int*]', inlined from 'boost::detail::multi_array::const_multi_array_view::const_multi_array_view(TPtr, const ExtentList&, const boost::array&) [with ExtentList = boost::array; Index = long int; T = int; long unsigned int NumDims = 1; TPtr = int*]' at /usr/include/boost/multi_array/view.hpp:240:13, inlined from 'boost::detail::multi_array::multi_array_view::multi_array_view(T*, const ExtentList&, const boost::array&) [with ExtentList = boost::array; Index = long int; T = int; long unsigned int NumDims = 1]' at /usr/include/boost/multi_array/view.hpp:434:36, inlined from 'ArrayRef boost::detail::multi_array::multi_array_impl_base::generate_array_view(boost::type, const boost::detail::multi_array::index_gen&, const size_type*, const index*, const index*, TPtr) const [with ArrayRef = boost::detail::multi_array::multi_array_view; int NDims = 1; TPtr = int*; T = int; long unsigned int NumDims = 2]' at /usr/include/boost/multi_array/base.hpp:490:27, inlined from 'typename boost::multi_array_ref::array_view::type boost::multi_array_ref::operator[](const boost::detail::multi_array::index_gen&) [with int NDims = 1; T = int; long unsigned int NumDims = 2]' at /usr/include/boost/multi_array/multi_array_ref.hpp:539:47, inlined from '_ZN10graph_tool24partition_overlap_centerIN5boost15multi_array_refIiLm1EEENS2_IiLm2EEEEEdRT_RT0_._omp_fn.0' at ../src/graph/inference/partition_modes/graph_partition_mode.hh:269:38: /usr/include/boost/multi_array/algorithm.hpp:56:13: warning: 'new_strides$elems$' may be used uninitialized [-Wmaybe-uninitialized] 56 | *result = *first; | ~~~~~~~~^~~~~~~~ /usr/include/boost/multi_array/base.hpp: In function '_ZN10graph_tool24partition_overlap_centerIN5boost15multi_array_refIiLm1EEENS2_IiLm2EEEEEdRT_RT0_._omp_fn.0': /usr/include/boost/multi_array/base.hpp:416:31: note: 'new_strides$elems$' was declared here 416 | boost::array new_strides; | ^~~~~~~~~~~ In function 'OutputIter boost::detail::multi_array::copy_n(InputIter, Size, OutputIter) [with InputIter = const long int*; Size = long unsigned int; OutputIter = long unsigned int*]', inlined from 'boost::detail::multi_array::const_multi_array_view::const_multi_array_view(TPtr, const ExtentList&, const boost::array&) [with ExtentList = boost::array; Index = long int; T = int; long unsigned int NumDims = 1; TPtr = int*]' at /usr/include/boost/multi_array/view.hpp:238:13, inlined from 'boost::detail::multi_array::multi_array_view::multi_array_view(T*, const ExtentList&, const boost::array&) [with ExtentList = boost::array; Index = long int; T = int; long unsigned int NumDims = 1]' at /usr/include/boost/multi_array/view.hpp:434:36, inlined from 'ArrayRef boost::detail::multi_array::multi_array_impl_base::generate_array_view(boost::type, const boost::detail::multi_array::index_gen&, const size_type*, const index*, const index*, TPtr) const [with ArrayRef = boost::detail::multi_array::multi_array_view; int NDims = 1; TPtr = int*; T = int; long unsigned int NumDims = 2]' at /usr/include/boost/multi_array/base.hpp:490:27, inlined from 'typename boost::multi_array_ref::array_view::type boost::multi_array_ref::operator[](const boost::detail::multi_array::index_gen&) [with int NDims = 1; T = int; long unsigned int NumDims = 2]' at /usr/include/boost/multi_array/multi_array_ref.hpp:539:47, inlined from '_ZN10graph_tool24partition_overlap_centerIN5boost15multi_array_refIiLm1EEENS2_IiLm2EEEEEdRT_RT0_._omp_fn.0' at ../src/graph/inference/partition_modes/graph_partition_mode.hh:269:38: /usr/include/boost/multi_array/algorithm.hpp:56:13: warning: 'new_extents$elems$' may be used uninitialized [-Wmaybe-uninitialized] 56 | *result = *first; | ~~~~~~~~^~~~~~~~ /usr/include/boost/multi_array/base.hpp: In function '_ZN10graph_tool24partition_overlap_centerIN5boost15multi_array_refIiLm1EEENS2_IiLm2EEEEEdRT_RT0_._omp_fn.0': /usr/include/boost/multi_array/base.hpp:417:31: note: 'new_extents$elems$' was declared here 417 | boost::array new_extents; | ^~~~~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_modes/graph_partition_mode_clustering_mcmc.lo ../src/graph/inference/partition_modes/graph_partition_mode_clustering_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_modes/graph_partition_mode_clustering_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering_mcmc.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_modes/graph_partition_mode_clustering_multiflip_mcmc.lo ../src/graph/inference/partition_modes/graph_partition_mode_clustering_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_modes/graph_partition_mode_clustering_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_modes/graph_partition_mode_clustering_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_modes/graph_partition_mode_clustering_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/partition_modes/graph_partition_mode_clustering_multilevel_mcmc.lo ../src/graph/inference/partition_modes/graph_partition_mode_clustering_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/partition_modes/graph_partition_mode_clustering_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/partition_modes/graph_partition_mode_clustering_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/planted_partition/graph_planted_partition.lo ../src/graph/inference/planted_partition/graph_planted_partition.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/planted_partition/graph_planted_partition.cc -fPIC -DPIC -o src/graph/inference/planted_partition/.libs/graph_planted_partition.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/planted_partition/graph_planted_partition.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/planted_partition/graph_planted_partition_gibbs.lo ../src/graph/inference/planted_partition/graph_planted_partition_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/planted_partition/graph_planted_partition_gibbs.cc -fPIC -DPIC -o src/graph/inference/planted_partition/.libs/graph_planted_partition_gibbs.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/planted_partition/graph_planted_partition_mcmc.lo ../src/graph/inference/planted_partition/graph_planted_partition_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/planted_partition/graph_planted_partition_mcmc.cc -fPIC -DPIC -o src/graph/inference/planted_partition/.libs/graph_planted_partition_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/planted_partition/graph_planted_partition_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/planted_partition/graph_planted_partition_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/planted_partition/graph_planted_partition_multiflip_mcmc.lo ../src/graph/inference/planted_partition/graph_planted_partition_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/planted_partition/graph_planted_partition_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/planted_partition/.libs/graph_planted_partition_multiflip_mcmc.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/planted_partition/graph_planted_partition_multilevel_mcmc.lo ../src/graph/inference/planted_partition/graph_planted_partition_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/planted_partition/graph_planted_partition_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/planted_partition/.libs/graph_planted_partition_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/planted_partition/graph_planted_partition_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/planted_partition/graph_planted_partition_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap.lo ../src/graph/inference/overlap/graph_blockmodel_overlap.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_exhaustive.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_exhaustive.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_exhaustive.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_exhaustive.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_exhaustive.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/inference/overlap/../loops/exhaustive_loop.hh:22, from ../src/graph/inference/overlap/graph_blockmodel_overlap_exhaustive.cc:26: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_gibbs.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_gibbs.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_gibbs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_mcmc.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_mcmc.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_mcmc_bundled.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_mcmc_bundled.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_mcmc_bundled.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_mcmc_bundled.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_mcmc_bundled.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multicanonical.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical_multiflip.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical_multiflip.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical_multiflip.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multicanonical_multiflip.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical_multiflip.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_multiflip_mcmc.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_multilevel_mcmc.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/overlap/graph_blockmodel_overlap_vacate.lo ../src/graph/inference/overlap/graph_blockmodel_overlap_vacate.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/overlap/graph_blockmodel_overlap_vacate.cc -fPIC -DPIC -o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_vacate.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/overlap/graph_blockmodel_overlap_vacate.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers.lo ../src/graph/inference/layers/graph_blockmodel_layers.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers.cc:23: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_exhaustive.lo ../src/graph/inference/layers/graph_blockmodel_layers_exhaustive.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_exhaustive.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_exhaustive.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_exhaustive.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/c++/14/bits/shared_ptr.h:53, from /usr/include/c++/14/memory:80, from /usr/include/boost/config/no_tr1/memory.hpp:21, from /usr/include/boost/get_pointer.hpp:14, from /usr/include/boost/python/object/pointer_holder.hpp:11, from /usr/include/boost/python/to_python_indirect.hpp:10, from /usr/include/boost/python/converter/arg_to_python.hpp:10, from /usr/include/boost/python/call.hpp:15, from /usr/include/boost/python/object_core.hpp:14, from /usr/include/boost/python/object.hpp:9, from ../src/graph/graph.hh:29, from ../src/graph/inference/layers/graph_blockmodel_layers.cc:19: In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ In file included from ../src/graph/inference/layers/../blockmodel/graph_blockmodel.hh:31, from ../src/graph/inference/layers/graph_blockmodel_layers.cc:26: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/inference/layers/../loops/exhaustive_loop.hh:22, from ../src/graph/inference/layers/graph_blockmodel_layers_exhaustive.cc:29: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_layered_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_layered_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_layered_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_layered_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_gibbs.lo ../src/graph/inference/layers/graph_blockmodel_layers_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_gibbs.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_gibbs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_imp.lo ../src/graph/inference/layers/graph_blockmodel_layers_imp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_imp.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_imp.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_imp.cc:20: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_mcmc.lo ../src/graph/inference/layers/graph_blockmodel_layers_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_mcmc.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_multicanonical.lo ../src/graph/inference/layers/graph_blockmodel_layers_multicanonical.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_multicanonical.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_multicanonical.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_multicanonical.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_multicanonical_multiflip.lo ../src/graph/inference/layers/graph_blockmodel_layers_multicanonical_multiflip.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_multicanonical_multiflip.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_multicanonical_multiflip.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_multicanonical_multiflip.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_multiflip_mcmc.lo ../src/graph/inference/layers/graph_blockmodel_layers_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_multilevel_mcmc.lo ../src/graph/inference/layers/graph_blockmodel_layers_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/c++/14/bits/shared_ptr.h:53, from /usr/include/c++/14/memory:80, from /usr/include/boost/config/no_tr1/memory.hpp:21, from /usr/include/boost/get_pointer.hpp:14, from /usr/include/boost/python/object/pointer_holder.hpp:11, from /usr/include/boost/python/to_python_indirect.hpp:10, from /usr/include/boost/python/converter/arg_to_python.hpp:10, from /usr/include/boost/python/call.hpp:15, from /usr/include/boost/python/object_core.hpp:14, from /usr/include/boost/python/object.hpp:9, from ../src/graph/graph.hh:29, from ../src/graph/graph_tool.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap.cc:18: In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ In file included from ../src/graph/inference/layers/../overlap/../blockmodel/graph_blockmodel.hh:31, from ../src/graph/inference/layers/../overlap/graph_blockmodel_overlap_util.hh:24, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap.cc:23: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {std::vector >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool}; Factory = graph_tool::StateFactory >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LayeredBlockState>, boost::mpl::vector >::make_dispatch >, std::vector >, boost::checked_vector_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, boost::checked_vector_property_map >, boost::typed_identity_property_map >, std::vector, std::equal_to, std::allocator > >, std::allocator, std::equal_to, std::allocator > > > >&, bool>::operator()<8, 0, 0, 1, 2, 3, 4, 5, 6, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6>, make_layered_overlap_block_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::OverlapBlockState >, std::integral_constant, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/layers/../overlap/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_exhaustive.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_exhaustive.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_exhaustive.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_exhaustive.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_exhaustive.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/inference/layers/../loops/exhaustive_loop.hh:22, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_exhaustive.cc:28: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_layered_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_layered_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, do_exhaustive_layered_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, do_exhaustive_layered_overlap_sweep_iter(boost::python::api::object, boost::python::api::object)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_gibbs.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_gibbs.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_gibbs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc_bundled.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc_bundled.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc_bundled.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_mcmc_bundled.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc_bundled.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multicanonical.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical_multiflip.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical_multiflip.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical_multiflip.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multicanonical_multiflip.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical_multiflip.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_multiflip_mcmc.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_multilevel_mcmc.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/layers/graph_blockmodel_layers_overlap_vacate.lo ../src/graph/inference/layers/graph_blockmodel_layers_overlap_vacate.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/layers/graph_blockmodel_layers_overlap_vacate.cc -fPIC -DPIC -o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_vacate.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/layers/graph_blockmodel_layers_overlap_vacate.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/ranked/graph_ranked.lo ../src/graph/inference/ranked/graph_ranked.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/ranked/graph_ranked.cc -fPIC -DPIC -o src/graph/inference/ranked/.libs/graph_ranked.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/ranked/graph_ranked.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/c++/14/bits/shared_ptr.h:53, from /usr/include/c++/14/memory:80, from /usr/include/boost/config/no_tr1/memory.hpp:21, from /usr/include/boost/get_pointer.hpp:14, from /usr/include/boost/python/object/pointer_holder.hpp:11, from /usr/include/boost/python/to_python_indirect.hpp:10, from /usr/include/boost/python/converter/arg_to_python.hpp:10, from /usr/include/boost/python/call.hpp:15, from /usr/include/boost/python/object_core.hpp:14, from /usr/include/boost/python/object.hpp:9, from ../src/graph/graph.hh:29, from ../src/graph/graph_tool.hh:21, from ../src/graph/inference/ranked/graph_ranked.cc:18: In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ In file included from ../src/graph/inference/ranked/graph_ranked.cc:23: ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::checked_vector_property_map >}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/ranked/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/ranked/../support/graph_state.hh:244:36, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/ranked/../support/graph_state.hh: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::python::api::object&}; Action = graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::RankedState>, boost::mpl::vector >::make_dispatch > >::operator()<2, 0, 0, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, make_ranked_state(boost::python::api::object, boost::python::api::object):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0>, make_ranked_state(boost::python::api::object, boost::python::api::object)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&) const::; Wrap = mpl_::bool_]': ../src/graph/inference/ranked/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/ranked/graph_ranked_mcmc.lo ../src/graph/inference/ranked/graph_ranked_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/ranked/graph_ranked_mcmc.cc -fPIC -DPIC -o src/graph/inference/ranked/.libs/graph_ranked_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/ranked/graph_ranked_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/ranked/graph_ranked_gibbs.lo ../src/graph/inference/ranked/graph_ranked_gibbs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/ranked/graph_ranked_gibbs.cc -fPIC -DPIC -o src/graph/inference/ranked/.libs/graph_ranked_gibbs.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/ranked/graph_ranked_gibbs.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/ranked/graph_ranked_multiflip_mcmc.lo ../src/graph/inference/ranked/graph_ranked_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/ranked/graph_ranked_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/ranked/.libs/graph_ranked_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/ranked/graph_ranked_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/ranked/graph_ranked_multilevel_mcmc.lo ../src/graph/inference/ranked/graph_ranked_multilevel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/ranked/graph_ranked_multilevel_mcmc.cc -fPIC -DPIC -o src/graph/inference/ranked/.libs/graph_ranked_multilevel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/ranked/graph_ranked_multilevel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics.lo ../src/graph/inference/uncertain/dynamics/dynamics.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics.cc:22: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_mcmc.lo ../src/graph/inference/uncertain/dynamics/dynamics_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_swap_mcmc.lo ../src/graph/inference/uncertain/dynamics/dynamics_swap_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_swap_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_swap_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_swap_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc.lo ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_multiflip_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc_theta.lo ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc_theta.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc_theta.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_multiflip_mcmc_theta.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc_theta.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_mcmc_theta.lo ../src/graph/inference/uncertain/dynamics/dynamics_mcmc_theta.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_mcmc_theta.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_mcmc_theta.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_mcmc_theta.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc.lo ../src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_parallel_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc_theta.lo ../src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc_theta.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc_theta.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_parallel_mcmc_theta.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc_theta.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/dynamics_parallel_swap_mcmc.lo ../src/graph/inference/uncertain/dynamics/dynamics_parallel_swap_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/dynamics_parallel_swap_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/.libs/dynamics_parallel_swap_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/dynamics/dynamics_parallel_swap_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/cising_glauber/state.lo ../src/graph/inference/uncertain/dynamics/cising_glauber/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/cising_glauber/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/cising_glauber/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/cising_glauber/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/cising_glauber/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/cising_glauber/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/epidemics/state.lo ../src/graph/inference/uncertain/dynamics/epidemics/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/epidemics/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/epidemics/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/epidemics/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/epidemics/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/epidemics/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/epidemics/../dynamics_discrete.hh:28, from ../src/graph/inference/uncertain/dynamics/epidemics/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/epidemics/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/ising_glauber/state.lo ../src/graph/inference/uncertain/dynamics/ising_glauber/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/ising_glauber/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/ising_glauber/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/ising_glauber/../dynamics_discrete.hh:28, from ../src/graph/inference/uncertain/dynamics/ising_glauber/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/ising_glauber/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/linear_normal/state.lo ../src/graph/inference/uncertain/dynamics/linear_normal/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/linear_normal/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/linear_normal/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/linear_normal/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/linear_normal/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/linear_normal/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/linear_normal/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/linear_normal/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/linear_normal/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/lotka_volterra/state.lo ../src/graph/inference/uncertain/dynamics/lotka_volterra/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/lotka_volterra/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/lotka_volterra/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/lotka_volterra/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/normal_glauber/state.lo ../src/graph/inference/uncertain/dynamics/normal_glauber/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/normal_glauber/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/normal_glauber/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/normal_glauber/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/normal_glauber/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/normal_glauber/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/pseudo_cising/state.lo ../src/graph/inference/uncertain/dynamics/pseudo_cising/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/pseudo_cising/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/pseudo_cising/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/pseudo_cising/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/pseudo_ising/state.lo ../src/graph/inference/uncertain/dynamics/pseudo_ising/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/pseudo_ising/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/pseudo_ising/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/../dynamics_discrete.hh:28, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/pseudo_ising/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/dynamics/pseudo_normal/state.lo ../src/graph/inference/uncertain/dynamics/pseudo_normal/state.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/dynamics/pseudo_normal/state.cc -fPIC -DPIC -o src/graph/inference/uncertain/dynamics/pseudo_normal/.libs/state.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/parallel_rng.hh:22, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../../../../generation/graph_knn.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../dynamics.hh:34, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../dynamics_base.hh:30, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/../dynamics_continuous.hh:28, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/setup.hh:18, from ../src/graph/inference/uncertain/dynamics/pseudo_normal/state.cc:18: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/latent_closure.lo ../src/graph/inference/uncertain/latent_closure.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/latent_closure.cc -fPIC -DPIC -o src/graph/inference/uncertain/.libs/latent_closure.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/latent_closure.cc:20: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/c++/14/bits/shared_ptr.h:53, from /usr/include/c++/14/memory:80, from /usr/include/boost/config/no_tr1/memory.hpp:21, from /usr/include/boost/get_pointer.hpp:14, from /usr/include/boost/python/object/pointer_holder.hpp:11, from /usr/include/boost/python/to_python_indirect.hpp:10, from /usr/include/boost/python/converter/arg_to_python.hpp:10, from /usr/include/boost/python/call.hpp:15, from /usr/include/boost/python/object_core.hpp:14, from /usr/include/boost/python/object.hpp:9, from ../src/graph/graph.hh:29, from ../src/graph/graph_tool.hh:21, from ../src/graph/inference/uncertain/latent_closure.cc:19: In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ In file included from ../src/graph/inference/uncertain/../blockmodel/graph_blockmodel.hh:31, from ../src/graph/inference/uncertain/latent_closure.cc:24: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState >, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1523:7: warning: '*(const std::__shared_ptr >, __gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)).std::__shared_ptr, __gnu_cxx::_S_atomic>::_M_ptr' may be used uninitialized [-Wmaybe-uninitialized] 1523 | __shared_ptr(const __shared_ptr&) noexcept = default; | ^~~~~~~~~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ In copy constructor 'std::__shared_count<_Lp>::__shared_count(const std::__shared_count<_Lp>&) [with __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]', inlined from 'std::__shared_ptr<_Tp, _Lp>::__shared_ptr(const std::__shared_ptr<_Tp, _Lp>&) [with _Tp = std::vector; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:1523:7, inlined from 'std::shared_ptr<_Tp>::shared_ptr(const std::shared_ptr<_Tp>&) [with _Tp = std::vector]' at /usr/include/c++/14/bits/shared_ptr.h:203:7, inlined from 'boost::checked_vector_property_map >::checked_vector_property_map(const boost::checked_vector_property_map >&)' at ../src/graph/fast_vector_property_map.hh:45:7, inlined from 'T graph_tool::StateWrap::make_dispatch::Extract::operator()(boost::python::api::object, std::string) const [with T = boost::checked_vector_property_map >; Ts = {boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::python::list, boost::checked_vector_property_map >, long unsigned int}; Factory = graph_tool::StateFactory, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>; TRS = {boost::mpl::vector}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:260:23, inlined from 'graph_tool::StateWrap, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > > >::LatentClosureState>, boost::mpl::vector >::make_dispatch >, long unsigned int>::operator()<9, 0, 0, 1, 2, 3, 4, 5, 6, 7, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t):::: >(boost::python::api::object&, std::array&, std::index_sequence<0>, std::index_sequence<0, 1, 2, 3, 4, 5, 6, 7>, make_latent_closure_state(boost::python::api::object, boost::python::api::object, boost::python::api::object, size_t)::::&&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, graph_tool::BlockState, const boost::adj_list&>, std::integral_constant, std::integral_constant, std::integral_constant, boost::any, boost::any, boost::any, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::unchecked_vector_property_map >, boost::typed_identity_property_map >, std::vector >, bool, std::vector >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, std::vector >, std::allocator > > >, boost::unchecked_vector_property_map >, std::vector >, std::allocator > > >, std::vector >, std::vector >, std::vector > >&, long unsigned int&) const:: [with auto:66 = {boost::python::api::object&}]' at ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:244:36: /usr/include/c++/14/bits/shared_ptr_base.h:1073:19: warning: '((const std::__shared_count<__gnu_cxx::_S_atomic>*)((char*)&extract + offsetof(boost::python::extract > >,boost::python::extract > >::.boost::python::converter::extract_rvalue > >::m_data.boost::python::converter::rvalue_from_python_data > >::.boost::python::converter::rvalue_from_python_storage > >::storage)))[1].std::__shared_count<>::_M_pi' may be used uninitialized [-Wmaybe-uninitialized] 1073 | : _M_pi(__r._M_pi) | ~~~~^~~~~ ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh: In lambda function: ../src/graph/inference/uncertain/../blockmodel/../support/graph_state.hh:257:36: note: 'extract' declared here 257 | python::extract extract(obj); | ^~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/latent_closure_mcmc.lo ../src/graph/inference/uncertain/latent_closure_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/latent_closure_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/.libs/latent_closure_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/latent_closure_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/measured.lo ../src/graph/inference/uncertain/measured.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/measured.cc -fPIC -DPIC -o src/graph/inference/uncertain/.libs/measured.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/measured.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/measured_mcmc.lo ../src/graph/inference/uncertain/measured_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/measured_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/.libs/measured_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/measured_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/uncertain.lo ../src/graph/inference/uncertain/uncertain.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/uncertain.cc -fPIC -DPIC -o src/graph/inference/uncertain/.libs/uncertain.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/uncertain.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/uncertain_marginal.lo ../src/graph/inference/uncertain/uncertain_marginal.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/uncertain_marginal.cc -fPIC -DPIC -o src/graph/inference/uncertain/.libs/uncertain_marginal.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/../blockmodel/../../generation/sampler.hh:21, from ../src/graph/inference/uncertain/../blockmodel/graph_blockmodel_elist.hh:21, from ../src/graph/inference/uncertain/../blockmodel/graph_blockmodel_util.hh:29, from ../src/graph/inference/uncertain/uncertain_marginal.hh:24, from ../src/graph/inference/uncertain/uncertain_marginal.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/uncertain/uncertain_mcmc.lo ../src/graph/inference/uncertain/uncertain_mcmc.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/uncertain/uncertain_mcmc.cc -fPIC -DPIC -o src/graph/inference/uncertain/.libs/uncertain_mcmc.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/uncertain/uncertain_mcmc.cc:19: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/support/cache.lo ../src/graph/inference/support/cache.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/support/cache.cc -fPIC -DPIC -o src/graph/inference/support/.libs/cache.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/support/int_part.lo ../src/graph/inference/support/int_part.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/support/int_part.cc -fPIC -DPIC -o src/graph/inference/support/.libs/int_part.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/support/spence.lo ../src/graph/inference/support/spence.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/support/spence.cc -fPIC -DPIC -o src/graph/inference/support/.libs/spence.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/graph_inference.lo ../src/graph/inference/graph_inference.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/graph_inference.cc -fPIC -DPIC -o src/graph/inference/.libs/graph_inference.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/inference/graph_inference.cc:23: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/graph_latent_multigraph.lo ../src/graph/inference/graph_latent_multigraph.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/graph_latent_multigraph.cc -fPIC -DPIC -o src/graph/inference/.libs/graph_latent_multigraph.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/inference/graph_modularity.lo ../src/graph/inference/graph_modularity.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/inference/graph_modularity.cc -fPIC -DPIC -o src/graph/inference/.libs/graph_modularity.o /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -ffast-math -funswitch-loops -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_inference_fast.la src/graph/inference/uncertain/dynamics/epidemics/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/cising_glauber/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/ising_glauber/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/pseudo_cising/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/pseudo_ising/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/pseudo_normal/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/linear_normal/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/lotka_volterra/libgraph_tool_inference_fast_la-base_vec.lo src/graph/inference/uncertain/dynamics/normal_glauber/libgraph_tool_inference_fast_la-base_vec.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp copying selected object files to avoid basename conflicts... libtool: link: ln src/graph/inference/uncertain/dynamics/cising_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt1-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/cising_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt1-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ln src/graph/inference/uncertain/dynamics/ising_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt2-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/ising_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt2-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ln src/graph/inference/uncertain/dynamics/pseudo_cising/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt3-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/pseudo_cising/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt3-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ln src/graph/inference/uncertain/dynamics/pseudo_ising/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt4-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/pseudo_ising/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt4-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ln src/graph/inference/uncertain/dynamics/pseudo_normal/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt5-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/pseudo_normal/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt5-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ln src/graph/inference/uncertain/dynamics/linear_normal/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt6-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/linear_normal/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt6-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ln src/graph/inference/uncertain/dynamics/lotka_volterra/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt7-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/lotka_volterra/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt7-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ln src/graph/inference/uncertain/dynamics/normal_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt8-libgraph_tool_inference_fast_la-base_vec.o || cp src/graph/inference/uncertain/dynamics/normal_glauber/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt8-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ar cr .libs/libgraph_tool_inference_fast.a src/graph/inference/uncertain/dynamics/epidemics/.libs/libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt1-libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt2-libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt3-libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt4-libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt5-libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt6-libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt7-libgraph_tool_inference_fast_la-base_vec.o .libs/libgraph_tool_inference_fast.lax/lt8-libgraph_tool_inference_fast_la-base_vec.o libtool: link: ranlib .libs/libgraph_tool_inference_fast.a libtool: link: rm -fr .libs/libgraph_tool_inference_fast.lax libtool: link: ( cd ".libs" && rm -f "libgraph_tool_inference_fast.la" && ln -s "../libgraph_tool_inference_fast.la" "libgraph_tool_inference_fast.la" ) /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/layout/graph_arf.lo ../src/graph/layout/graph_arf.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/layout/graph_arf.cc -fPIC -DPIC -o src/graph/layout/.libs/graph_arf.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/layout/graph_planar_layout.lo ../src/graph/layout/graph_planar_layout.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/layout/graph_planar_layout.cc -fPIC -DPIC -o src/graph/layout/.libs/graph_planar_layout.o In file included from /usr/include/c++/14/iterator:63, from ../src/graph/graph.hh:23, from ../src/graph/graph_filtering.hh:21, from ../src/graph/layout/graph_planar_layout.cc:18: In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::chrobak_payne_straight_line_drawing(const Graph&, PlanarEmbedding, ForwardIterator, ForwardIterator, GridPositionMap, VertexIndexMap) [with Graph = filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; PlanarEmbedding = unchecked_vector_property_map, std::allocator > >, typed_identity_property_map >; ForwardIterator = __gnu_cxx::__normal_iterator >; GridPositionMap = unchecked_vector_property_map >; VertexIndexMap = typed_identity_property_map]' at /usr/include/boost/graph/chrobak_payne_drawing.hpp:214:18: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'next_to_rightmost' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ In file included from ../src/graph/layout/graph_planar_layout.cc:22: /usr/include/boost/graph/chrobak_payne_drawing.hpp: In function 'void boost::chrobak_payne_straight_line_drawing(const Graph&, PlanarEmbedding, ForwardIterator, ForwardIterator, GridPositionMap, VertexIndexMap) [with Graph = filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; PlanarEmbedding = unchecked_vector_property_map, std::allocator > >, typed_identity_property_map >; ForwardIterator = __gnu_cxx::__normal_iterator >; GridPositionMap = unchecked_vector_property_map >; VertexIndexMap = typed_identity_property_map]': /usr/include/boost/graph/chrobak_payne_drawing.hpp:207:22: note: 'next_to_rightmost' was declared here 207 | vertex_t next_to_rightmost; | ^~~~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::chrobak_payne_straight_line_drawing(const Graph&, PlanarEmbedding, ForwardIterator, ForwardIterator, GridPositionMap, VertexIndexMap) [with Graph = undirected_adaptor >; PlanarEmbedding = unchecked_vector_property_map, std::allocator > >, typed_identity_property_map >; ForwardIterator = __gnu_cxx::__normal_iterator >; GridPositionMap = unchecked_vector_property_map >; VertexIndexMap = typed_identity_property_map]' at /usr/include/boost/graph/chrobak_payne_drawing.hpp:214:18: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'next_to_rightmost' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/chrobak_payne_drawing.hpp: In function 'void boost::chrobak_payne_straight_line_drawing(const Graph&, PlanarEmbedding, ForwardIterator, ForwardIterator, GridPositionMap, VertexIndexMap) [with Graph = undirected_adaptor >; PlanarEmbedding = unchecked_vector_property_map, std::allocator > >, typed_identity_property_map >; ForwardIterator = __gnu_cxx::__normal_iterator >; GridPositionMap = unchecked_vector_property_map >; VertexIndexMap = typed_identity_property_map]': /usr/include/boost/graph/chrobak_payne_drawing.hpp:207:22: note: 'next_to_rightmost' was declared here 207 | vertex_t next_to_rightmost; | ^~~~~~~~~~~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/layout/graph_fruchterman_reingold.lo ../src/graph/layout/graph_fruchterman_reingold.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/layout/graph_fruchterman_reingold.cc -fPIC -DPIC -o src/graph/layout/.libs/graph_fruchterman_reingold.o In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::circle_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = circle_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = long double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, long double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, long double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, long double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force >, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force >, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force >, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = all_force_pairs; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::all_force_pairs; Cooling = anneal_cooling; Param = boost::all_force_pairs; Tag = boost::force_pairs_t; Rest = boost::bgl_named_params, boost::cooling_t, boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = all_force_pairs; Tag = force_pairs_t; Rest = bgl_named_params, cooling_t, bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> > >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:350:38, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[1]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ In member function 'boost::convex_topology<2>::point graph_tool::convert::point, std::vector >::operator()(const std::vector&) const [with Val = double]', inlined from 'graph_tool::ConvertedPropertyMap::value_type graph_tool::ConvertedPropertyMap::do_get(const key_type&) const [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point; Converter = graph_tool::convert]' at ../src/graph/graph_properties.hh:629:27, inlined from 'Type graph_tool::get(ConvertedPropertyMap, typename ConvertedPropertyMap::key_type) [with PropertyMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; Type = boost::convex_topology<2>::point]' at ../src/graph/graph_properties.hh:646:23, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, DisplacementMap) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = grid_force_pairs, graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; DisplacementMap = iterator_property_map<__gnu_cxx::__normal_iterator::point_difference*, std::vector::point_difference, std::allocator::point_difference> > >, typed_identity_property_map, convex_topology<2>::point_difference, convex_topology<2>::point_difference&>]' at /usr/include/boost/graph/fruchterman_reingold.hpp:351:44, inlined from 'static void boost::detail::fr_force_directed_layout::run(const Graph&, PositionMap, const Topology&, AttractiveForce, RepulsiveForce, ForcePairs, Cooling, boost::param_not_found, const boost::bgl_named_params&) [with Topology = boost::square_topology<>; Graph = boost::undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert>; AttractiveForce = get_layout >::attr_force, double>; RepulsiveForce = get_layout >::rep_force; ForcePairs = boost::grid_force_pairs, graph_tool::ConvertedPropertyMap, boost::typed_identity_property_map >, boost::convex_topology<2>::point, graph_tool::convert> >; Cooling = anneal_cooling; Param = anneal_cooling; Tag = boost::cooling_t; Rest = boost::bgl_named_params >::rep_force, boost::repulsive_force_t, boost::bgl_named_params >::attr_force, double>, boost::attractive_force_t, boost::no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:416:55, inlined from 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]' at /usr/include/boost/graph/fruchterman_reingold.hpp:436:47: ../src/graph/layout/graph_fruchterman_reingold.cc:63:16: warning: '*(__vector(2) double*)((char*)&p + offsetof(boost::convex_topology<2>::point, boost::convex_topology<2>::point::values[0]))' may be used uninitialized [-Wmaybe-uninitialized] 63 | return p; | ^ ../src/graph/layout/graph_fruchterman_reingold.cc: In function 'void boost::fruchterman_reingold_force_directed_layout(const Graph&, PositionMap, const Topology&, const bgl_named_params&) [with Topology = square_topology<>; Graph = undirected_adaptor >; PositionMap = graph_tool::ConvertedPropertyMap, typed_identity_property_map >, convex_topology<2>::point, graph_tool::convert>; Param = anneal_cooling; Tag = cooling_t; Rest = bgl_named_params >::rep_force, repulsive_force_t, bgl_named_params >::attr_force, double>, attractive_force_t, no_property> >]': ../src/graph/layout/graph_fruchterman_reingold.cc:60:44: note: 'p' declared here 60 | typename convex_topology<2>::point p; | ^ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/layout/graph_sfdp.lo ../src/graph/layout/graph_sfdp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/layout/graph_sfdp.cc -fPIC -DPIC -o src/graph/layout/.libs/graph_sfdp.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/layout/../generation/sampler.hh:21, from ../src/graph/layout/graph_sfdp.hh:26, from ../src/graph/layout/graph_sfdp.cc:23: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/layout/graph_radial.lo ../src/graph/layout/graph_radial.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/layout/graph_radial.cc -fPIC -DPIC -o src/graph/layout/.libs/graph_radial.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/layout/graph_bind_layout.lo ../src/graph/layout/graph_bind_layout.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/layout/graph_bind_layout.cc -fPIC -DPIC -o src/graph/layout/.libs/graph_bind_layout.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/search/graph_bfs.lo ../src/graph/search/graph_bfs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/search/graph_bfs.cc -fPIC -DPIC -o src/graph/search/.libs/graph_bfs.o In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/search/graph_bfs.cc:19: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, bfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/search/graph_dfs.lo ../src/graph/search/graph_dfs.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/search/graph_dfs.cc -fPIC -DPIC -o src/graph/search/.libs/graph_dfs.o In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/search/graph_dfs.cc:19: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, dfs_search_generator(graph_tool::GraphInterface&, size_t)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/search/graph_dijkstra.lo ../src/graph/search/graph_dijkstra.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/search/graph_dijkstra.cc -fPIC -DPIC -o src/graph/search/.libs/graph_dijkstra.o In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/search/graph_dijkstra.cc:19: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16, inlined from 'boost::coroutines2::detail::pull_coroutine::~pull_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_coroutine.ipp:64:24, inlined from 'constexpr void std::_Destroy(_Tp*) [with _Tp = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/stl_construct.h:151:22, inlined from 'static void std::allocator_traits >::destroy(allocator_type&, _Up*) [with _Up = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/alloc_traits.h:720:17, inlined from 'void std::_Sp_counted_ptr_inplace<_Tp, _Alloc, _Lp>::_M_dispose() [with _Tp = boost::coroutines2::detail::pull_coroutine; _Alloc = std::allocator; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:616:35: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)MEM[(struct pull_coroutine *)this_2(D) + 16B].cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/search/graph_bellman_ford.lo ../src/graph/search/graph_bellman_ford.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/search/graph_bellman_ford.cc -fPIC -DPIC -o src/graph/search/.libs/graph_bellman_ford.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/search/graph_astar.lo ../src/graph/search/graph_astar.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/search/graph_astar.cc -fPIC -DPIC -o src/graph/search/.libs/graph_astar.o In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/search/graph_astar.cc:19: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16, inlined from 'boost::coroutines2::detail::pull_coroutine::~pull_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_coroutine.ipp:64:24, inlined from 'constexpr void std::_Destroy(_Tp*) [with _Tp = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/stl_construct.h:151:22, inlined from 'static void std::allocator_traits >::destroy(allocator_type&, _Up*) [with _Up = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/alloc_traits.h:720:17, inlined from 'void std::_Sp_counted_ptr_inplace<_Tp, _Alloc, _Lp>::_M_dispose() [with _Tp = boost::coroutines2::detail::pull_coroutine; _Alloc = std::allocator; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:616:35: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)MEM[(struct pull_coroutine *)this_2(D) + 16B].cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/search/graph_astar_implicit.lo ../src/graph/search/graph_astar_implicit.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/search/graph_astar_implicit.cc -fPIC -DPIC -o src/graph/search/.libs/graph_astar_implicit.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/search/graph_search_bind.lo ../src/graph/search/graph_search_bind.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/search/graph_search_bind.cc -fPIC -DPIC -o src/graph/search/.libs/graph_search_bind.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/spectral/graph_adjacency.lo ../src/graph/spectral/graph_adjacency.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/spectral/graph_adjacency.cc -fPIC -DPIC -o src/graph/spectral/.libs/graph_adjacency.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/spectral/graph_incidence.lo ../src/graph/spectral/graph_incidence.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/spectral/graph_incidence.cc -fPIC -DPIC -o src/graph/spectral/.libs/graph_incidence.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/spectral/graph_laplacian.lo ../src/graph/spectral/graph_laplacian.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/spectral/graph_laplacian.cc -fPIC -DPIC -o src/graph/spectral/.libs/graph_laplacian.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/spectral/graph_norm_laplacian.lo ../src/graph/spectral/graph_norm_laplacian.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/spectral/graph_norm_laplacian.cc -fPIC -DPIC -o src/graph/spectral/.libs/graph_norm_laplacian.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/spectral/graph_matrix.lo ../src/graph/spectral/graph_matrix.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/spectral/graph_matrix.cc -fPIC -DPIC -o src/graph/spectral/.libs/graph_matrix.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/spectral/graph_transition.lo ../src/graph/spectral/graph_transition.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/spectral/graph_transition.cc -fPIC -DPIC -o src/graph/spectral/.libs/graph_transition.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/spectral/graph_nonbacktracking.lo ../src/graph/spectral/graph_nonbacktracking.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/spectral/graph_nonbacktracking.cc -fPIC -DPIC -o src/graph/spectral/.libs/graph_nonbacktracking.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/stats/graph_histograms.lo ../src/graph/stats/graph_histograms.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/stats/graph_histograms.cc -fPIC -DPIC -o src/graph/stats/.libs/graph_histograms.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/stats/graph_average.lo ../src/graph/stats/graph_average.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/stats/graph_average.cc -fPIC -DPIC -o src/graph/stats/.libs/graph_average.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/stats/graph_distance.lo ../src/graph/stats/graph_distance.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/stats/graph_distance.cc -fPIC -DPIC -o src/graph/stats/.libs/graph_distance.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/stats/graph_distance_sampled.lo ../src/graph/stats/graph_distance_sampled.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/stats/graph_distance_sampled.cc -fPIC -DPIC -o src/graph/stats/.libs/graph_distance_sampled.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/stats/graph_distance_sampled.cc:25: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/stats/graph_stats_bind.lo ../src/graph/stats/graph_stats_bind.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/stats/graph_stats_bind.cc -fPIC -DPIC -o src/graph/stats/.libs/graph_stats_bind.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_all_circuits.lo ../src/graph/topology/graph_all_circuits.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_all_circuits.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_all_circuits.o In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/topology/graph_all_circuits.cc:22: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_all_circuits(graph_tool::GraphInterface&, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_all_circuits(graph_tool::GraphInterface&, bool)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_all_distances.lo ../src/graph/topology/graph_all_distances.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_all_distances.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_all_distances.o In file included from /usr/include/boost/graph/detail/adjacency_list.hpp:35, from /usr/include/boost/graph/adjacency_list.hpp:255, from /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:30, from ../src/graph/topology/graph_all_distances.cc:25: In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:28: /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 104 | typename GTraits::edge_iterator i, end; | ^~~ In file included from /usr/include/c++/14/vector:66, from /usr/include/c++/14/functional:64, from /usr/include/boost/config/no_tr1/functional.hpp:21, from /usr/include/boost/function/detail/prologue.hpp:15, from /usr/include/boost/function/function_template.hpp:13, from /usr/include/boost/function/detail/maybe_include.hpp:15, from /usr/include/boost/function/function0.hpp:11, from /usr/include/boost/python/errors.hpp:13, from /usr/include/boost/python/handle.hpp:11, from /usr/include/boost/python/converter/arg_to_python_base.hpp:7, from /usr/include/boost/python/converter/arg_to_python.hpp:14, from /usr/include/boost/python/call.hpp:15, from /usr/include/boost/python/object_core.hpp:14, from /usr/include/boost/python/object.hpp:9, from ../src/graph/graph.hh:29, from ../src/graph/topology/graph_all_distances.cc:18: In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::operator[](size_type) [with _Tp = boost::detail::adj_list_gen, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex; _Alloc = std::allocator, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex>]', inlined from 'Reference boost::vec_adj_list_vertex_property_map::operator[](key_type) const [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; GraphPtr = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*; ValueType = unsigned char; Reference = unsigned char&; Tag = boost::vertex_distance_t]' at /usr/include/boost/graph/detail/adjacency_list.hpp:2560:50, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:125:32: /usr/include/c++/14/bits/stl_vector.h:1131:41: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1131 | return *(this->_M_impl._M_start + __n); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:51: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, unsigned char, unsigned char&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 104 | typename GTraits::edge_iterator i, end; | ^~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::operator[](size_type) [with _Tp = boost::detail::adj_list_gen, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex; _Alloc = std::allocator, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex>]', inlined from 'Reference boost::vec_adj_list_vertex_property_map::operator[](key_type) const [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; GraphPtr = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*; ValueType = short int; Reference = short int&; Tag = boost::vertex_distance_t]' at /usr/include/boost/graph/detail/adjacency_list.hpp:2560:50, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:125:32: /usr/include/c++/14/bits/stl_vector.h:1131:41: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1131 | return *(this->_M_impl._M_start + __n); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:51: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, short int, short int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 104 | typename GTraits::edge_iterator i, end; | ^~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::operator[](size_type) [with _Tp = boost::detail::adj_list_gen, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex; _Alloc = std::allocator, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex>]', inlined from 'Reference boost::vec_adj_list_vertex_property_map::operator[](key_type) const [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; GraphPtr = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*; ValueType = int; Reference = int&; Tag = boost::vertex_distance_t]' at /usr/include/boost/graph/detail/adjacency_list.hpp:2560:50, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:125:32: /usr/include/c++/14/bits/stl_vector.h:1131:41: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1131 | return *(this->_M_impl._M_start + __n); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:51: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, int, int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 104 | typename GTraits::edge_iterator i, end; | ^~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::operator[](size_type) [with _Tp = boost::detail::adj_list_gen, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex; _Alloc = std::allocator, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex>]', inlined from 'Reference boost::vec_adj_list_vertex_property_map::operator[](key_type) const [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; GraphPtr = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*; ValueType = long int; Reference = long int&; Tag = boost::vertex_distance_t]' at /usr/include/boost/graph/detail/adjacency_list.hpp:2560:50, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:125:32: /usr/include/c++/14/bits/stl_vector.h:1131:41: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1131 | return *(this->_M_impl._M_start + __n); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:51: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long int, long int&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 104 | typename GTraits::edge_iterator i, end; | ^~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::operator[](size_type) [with _Tp = boost::detail::adj_list_gen, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex; _Alloc = std::allocator, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex>]', inlined from 'Reference boost::vec_adj_list_vertex_property_map::operator[](key_type) const [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; GraphPtr = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*; ValueType = double; Reference = double&; Tag = boost::vertex_distance_t]' at /usr/include/boost/graph/detail/adjacency_list.hpp:2560:50, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:125:32: /usr/include/c++/14/bits/stl_vector.h:1131:41: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1131 | return *(this->_M_impl._M_start + __n); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:51: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 104 | typename GTraits::edge_iterator i, end; | ^~~ In member function 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::operator[](size_type) [with _Tp = boost::detail::adj_list_gen, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex; _Alloc = std::allocator, boost::property >, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property, boost::property >, boost::no_property, boost::listS>::config::stored_vertex>]', inlined from 'Reference boost::vec_adj_list_vertex_property_map::operator[](key_type) const [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; GraphPtr = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*; ValueType = long double; Reference = long double&; Tag = boost::vertex_distance_t]' at /usr/include/boost/graph/detail/adjacency_list.hpp:2560:50, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:125:32: /usr/include/c++/14/bits/stl_vector.h:1131:41: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1131 | return *(this->_M_impl._M_start + __n); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:51: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]' at /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:124:43: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/bellman_ford_shortest_paths.hpp: In function 'bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, long double, long double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:104:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&i + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 104 | typename GTraits::edge_iterator i, end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In file included from /usr/include/boost/property_map/shared_array_property_map.hpp:13, from /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:27: In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long double; DistanceZero = long double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = unsigned char]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = unsigned char; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = unsigned char&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:20: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = unsigned char; DistanceZero = unsigned char]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, unsigned char, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, unsigned char, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, unsigned char, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = short int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = short int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = short int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = short int; DistanceZero = short int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, short int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, short int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, short int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = int; DistanceZero = int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = long int]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = long int; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = long int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = long int; DistanceZero = long int]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, long int, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, long int, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, long int, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, const adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::undirected_adaptor >; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const undirected_adaptor >; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::undirected_adaptor >&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::undirected_adaptor >&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::reversed_graph, const boost::adj_list&>; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const reversed_graph, const adj_list&>; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::reversed_graph, const boost::adj_list&>; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::reversed_graph, const boost::adj_list&>&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:40: note: '*(boost::detail::stored_edge_property > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^~~~~ In member function 'T& boost::shared_array::operator[](std::ptrdiff_t) const [with T = double]', inlined from 'T& boost::shared_array_property_map::operator[](key_type) const [with T = double; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]' at /usr/include/boost/property_map/shared_array_property_map.hpp:36:16, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = shared_array_property_map, long unsigned int> >; Reference = double&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:122:40, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/smart_ptr/shared_array.hpp:203:18: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 203 | return px[i]; | ~~^ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:60, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '((boost::detail::stored_edge_property > >* const*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]', inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; VertexID = typed_identity_property_map; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:118:50, inlined from 'bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = const boost::adj_list; DistanceMatrix = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::bgl_named_params >, double, graph_tool::convert>, boost::edge_weight_t, boost::no_property>; Weight = graph_tool::ConvertedPropertyMap >, double, graph_tool::convert>; VertexID = boost::typed_identity_property_map]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48, inlined from 'bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, const bgl_named_params&) [with VertexAndEdgeListGraph = const adj_list; DistanceMatrix = unchecked_vector_property_map, typed_identity_property_map >; P = typed_identity_property_map; T = vertex_index_t; R = bgl_named_params >, double, graph_tool::convert>, edge_weight_t, no_property>]' at /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:182:36, inlined from 'void do_all_pairs_search::operator()(const Graph&, VertexIndexMap, DistMap, WeightMap, bool) const [with Graph = boost::adj_list; VertexIndexMap = boost::typed_identity_property_map; DistMap = boost::unchecked_vector_property_map, boost::typed_identity_property_map >; WeightMap = boost::unchecked_vector_property_map >]' at ../src/graph/topology/graph_all_distances.cc:57:17, inlined from 'get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool):: [with auto:64 = boost::adj_list&; auto:65 = boost::unchecked_vector_property_map, boost::typed_identity_property_map >&; auto:66 = boost::unchecked_vector_property_map >&]' at ../src/graph/topology/graph_all_distances.cc:151:22, inlined from 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]' at ../src/graph/graph_filtering.hh:432:11: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In member function 'void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::adj_list&, boost::checked_vector_property_map >, boost::typed_identity_property_map >&, boost::checked_vector_property_map >&}; Action = get_all_dists(graph_tool::GraphInterface&, boost::any, boost::any, bool)::; Wrap = mpl_::bool_]': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:101:37: note: '*(__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >*)((char*)&e + offsetof(boost::detail::edge_iterator, 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> >::edges.boost::optional > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >::_M_current' was declared here 101 | typename Traits2::edge_iterator e, e_end; | ^ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_bipartite.lo ../src/graph/topology/graph_bipartite.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_bipartite.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_bipartite.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_components.lo ../src/graph/topology/graph_components.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_components.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_components.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_distance.lo ../src/graph/topology/graph_distance.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_distance.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_distance.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/topology/../generation/sampler.hh:21, from ../src/graph/topology/graph_distance.cc:26: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/graph_python_interface.hh:48, from ../src/graph/topology/graph_distance.cc:22: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16, inlined from 'boost::coroutines2::detail::pull_coroutine::~pull_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_coroutine.ipp:64:24, inlined from 'constexpr void std::_Destroy(_Tp*) [with _Tp = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/stl_construct.h:151:22, inlined from 'static void std::allocator_traits >::destroy(allocator_type&, _Up*) [with _Up = boost::coroutines2::detail::pull_coroutine]' at /usr/include/c++/14/bits/alloc_traits.h:720:17, inlined from 'void std::_Sp_counted_ptr_inplace<_Tp, _Alloc, _Lp>::_M_dispose() [with _Tp = boost::coroutines2::detail::pull_coroutine; _Alloc = std::allocator; __gnu_cxx::_Lock_policy _Lp = __gnu_cxx::_S_atomic]' at /usr/include/c++/14/bits/shared_ptr_base.h:616:35: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)MEM[(struct pull_coroutine *)this_2(D) + 16B].cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15, inlined from 'void boost::coroutines2::detail::pull_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:140:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)this)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_diameter.lo ../src/graph/topology/graph_diameter.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_diameter.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_diameter.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_dominator_tree.lo ../src/graph/topology/graph_dominator_tree.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_dominator_tree.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_dominator_tree.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_isomorphism.lo ../src/graph/topology/graph_isomorphism.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_isomorphism.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_isomorphism.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_kcore.lo ../src/graph/topology/graph_kcore.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_kcore.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_kcore.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_matching.lo ../src/graph/topology/graph_matching.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_matching.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_matching.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_maximal_cliques.lo ../src/graph/topology/graph_maximal_cliques.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_maximal_cliques.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_maximal_cliques.o In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/topology/graph_maximal_cliques.cc:20: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, get_max_cliques(graph_tool::GraphInterface&)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, get_max_cliques(graph_tool::GraphInterface&)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_maximal_planar.lo ../src/graph/topology/graph_maximal_planar.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_maximal_planar.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_maximal_planar.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_maximal_vertex_set.lo ../src/graph/topology/graph_maximal_vertex_set.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_maximal_vertex_set.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_maximal_vertex_set.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/topology/graph_maximal_vertex_set.cc:24: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_minimum_spanning_tree.lo ../src/graph/topology/graph_minimum_spanning_tree.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_minimum_spanning_tree.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_minimum_spanning_tree.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_percolation.lo ../src/graph/topology/graph_percolation.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_percolation.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_percolation.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_planar.lo ../src/graph/topology/graph_planar.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_planar.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_planar.o In file included from /usr/include/c++/14/iterator:63, from ../src/graph/graph.hh:23, from ../src/graph/graph_filtering.hh:21, from ../src/graph/topology/graph_planar.cc:18: In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ In file included from /usr/include/boost/graph/boyer_myrvold_planar_test.hpp:12, from ../src/graph/topology/graph_planar.cc:22: /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_random_matching.lo ../src/graph/topology/graph_random_matching.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_random_matching.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_random_matching.o In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/topology/graph_random_matching.cc:24: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter > >; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1582:44: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52, inlined from 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]' at /usr/include/boost/graph/boyer_myrvold_planar_test.hpp:106:61: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]', inlined from 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]' at /usr/include/boost/graph/boyer_myrvold_planar_test.hpp:106:61: /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1264:9: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1264 | if (bicomp_root != v) | ^~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::typed_identity_property_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]' at /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52, inlined from 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::false_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple, std::allocator > >, boost::typed_identity_property_map > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]' at /usr/include/boost/graph/boyer_myrvold_planar_test.hpp:193:61: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: 'previous_vertex' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::false_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple, std::allocator > >, boost::typed_identity_property_map > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: 'previous_vertex' was declared here 1153 | vertex_t previous_vertex; | ^~~~~~~~~~~~~~~ In member function 'void boost::boyer_myrvold_impl::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = get_planar_embedding::edge_inserter; EdgeIndexMap = boost::unchecked_vector_property_map >; Graph = boost::undirected_adaptor >; VertexIndexMap = boost::typed_identity_property_map; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::recursive_lazy_list]', inlined from 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::false_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple, std::allocator > >, boost::typed_identity_property_map > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]' at /usr/include/boost/graph/boyer_myrvold_planar_test.hpp:193:61: /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1264:9: warning: 'bicomp_root' may be used uninitialized [-Wmaybe-uninitialized] 1264 | if (bicomp_root != v) | ^~ /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In function 'bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::false_, mpl_::false_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple, std::allocator > >, boost::typed_identity_property_map > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant >, boost::parameter::aux::flat_like_arg_tuple > > >, std::integral_constant > >]': /usr/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: 'bicomp_root' was declared here 1111 | vertex_t bicomp_root; | ^~~~~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_random_spanning_tree.lo ../src/graph/topology/graph_random_spanning_tree.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_random_spanning_tree.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_random_spanning_tree.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_reciprocity.lo ../src/graph/topology/graph_reciprocity.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_reciprocity.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_reciprocity.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/topology/graph_random_spanning_tree.cc:22: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_sequential_color.lo ../src/graph/topology/graph_sequential_color.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_sequential_color.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_sequential_color.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_similarity.lo ../src/graph/topology/graph_similarity.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_similarity.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_similarity.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_similarity_imp.lo ../src/graph/topology/graph_similarity_imp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_similarity_imp.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_similarity_imp.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_subgraph_isomorphism.lo ../src/graph/topology/graph_subgraph_isomorphism.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_subgraph_isomorphism.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_subgraph_isomorphism.o In file included from ../src/pcg-cpp/include/pcg_random.hpp:114, from ../src/graph/random.hh:21, from ../src/graph/topology/graph_subgraph_isomorphism.cc:20: ../src/pcg-cpp/include/pcg_extras.hpp:630:25: warning: macro "__DATE__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ ../src/pcg-cpp/include/pcg_extras.hpp:630:34: warning: macro "__TIME__" might prevent reproducible builds [-Wdate-time] 630 | __DATE__ __TIME__ __FILE__); | ^~~~~~~~ In file included from /usr/include/boost/coroutine2/detail/pull_control_block_cc.hpp:16, from /usr/include/boost/coroutine2/detail/coroutine.hpp:32, from /usr/include/boost/coroutine2/coroutine.hpp:15, from /usr/include/boost/coroutine2/all.hpp:10, from ../src/graph/coroutine.hh:28, from ../src/graph/topology/graph_subgraph_isomorphism.cc:21: In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::pull_coroutine::control_block::destroy(boost::coroutines2::detail::pull_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:41:15: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)cb)[4]' is used uninitialized [-Wuninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_topological_sort.lo ../src/graph/topology/graph_topological_sort.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_topological_sort.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_topological_sort.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_topology.lo ../src/graph/topology/graph_topology.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_topology.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_topology.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_tsp.lo ../src/graph/topology/graph_tsp.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_tsp.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_tsp.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_transitive_closure.lo ../src/graph/topology/graph_transitive_closure.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_transitive_closure.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_transitive_closure.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/topology/graph_vertex_similarity.lo ../src/graph/topology/graph_vertex_similarity.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/topology/graph_vertex_similarity.cc -fPIC -DPIC -o src/graph/topology/.libs/graph_vertex_similarity.o /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/util/graph_search.lo ../src/graph/util/graph_search.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/util/graph_search.cc -fPIC -DPIC -o src/graph/util/.libs/graph_search.o In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ In function 'boost::coroutines2::detail::state_t& boost::coroutines2::detail::operator|=(state_t&, state_t)', inlined from 'static void boost::coroutines2::detail::push_coroutine::control_block::destroy(boost::coroutines2::detail::push_coroutine::control_block*) [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:40:15, inlined from 'void boost::coroutines2::detail::push_coroutine::control_block::deallocate() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_control_block_cc.ipp:127:16, inlined from 'boost::coroutines2::detail::push_coroutine::~push_coroutine() [with T = boost::python::api::object]' at /usr/include/boost/coroutine2/detail/push_coroutine.ipp:53:24, inlined from 'boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&):: mutable' at /usr/include/boost/coroutine2/detail/pull_control_block_cc.ipp:104:8, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = boost::context::fiber; _Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:61:67, inlined from 'constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/bits/invoke.h:97:36, inlined from 'std::invoke_result_t<_Callable, _Args ...> std::invoke(_Callable&&, _Args&& ...) [with _Callable = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::&; _Args = {boost::context::fiber}]' at /usr/include/c++/14/functional:121:37, inlined from 'void* boost::context::detail::fiber_record::run(boost::context::detail::fcontext_t) [with Ctx = boost::context::fiber; StackAlloc = boost::context::basic_fixedsize_stack; Fn = boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&)::]' at /usr/include/boost/context/fiber_fcontext.hpp:157:13, inlined from 'void boost::context::detail::fiber_entry(transfer_t) [with Rec = fiber_record, boost::coroutines2::detail::pull_coroutine::control_block::control_block, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&>(boost::context::preallocated, boost::context::basic_fixedsize_stack&&, subgraph_isomorphism(graph_tool::GraphInterface&, graph_tool::GraphInterface&, boost::any, boost::any, boost::any, boost::any, size_t, bool, bool, bool)::&):: >]' at /usr/include/boost/context/fiber_fcontext.hpp:97:26: /usr/include/boost/coroutine2/detail/state.hpp:70:11: warning: '((boost::coroutines2::detail::state_t*)synthesized.cb_)[4]' may be used uninitialized [-Wmaybe-uninitialized] 70 | l = l | r; | ~~^~~ /bin/bash ./libtool --tag=CXX --mode=compile g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c -o src/graph/util/graph_util_bind.lo ../src/graph/util/graph_util_bind.cc libtool: compile: g++ -std=gnu++17 -DHAVE_CONFIG_H -I. -I.. -I../src/boost-workaround -I../src/pcg-cpp/include -DHAVE_CONFIG_H -I../src/graph -I. -I/usr/lib/python3/dist-packages/cairo/include -I/usr/include/python3.13 -pthread -I/usr/include -I/usr/lib/python3/dist-packages/numpy/core/include -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -c ../src/graph/util/graph_util_bind.cc -fPIC -DPIC -o src/graph/util/.libs/graph_util_bind.o /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -lcairomm-1.0 -lsigc-2.0 -lcairo -Wl,-z,relro -Wl,-z,now -o libgt_pycairo_aux.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/draw src/graph/draw/libgt_pycairo_aux_la-pycairo_aux.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/draw/.libs/libgt_pycairo_aux_la-pycairo_aux.o -lcairomm-1.0 -lsigc-2.0 -lcairo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgt_pycairo_aux.so -o .libs/libgt_pycairo_aux.so libtool: link: ( cd ".libs" && rm -f "libgt_pycairo_aux.la" && ln -s "../libgt_pycairo_aux.la" "libgt_pycairo_aux.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_centrality.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/centrality src/graph/centrality/graph_betweenness.lo src/graph/centrality/graph_centrality_bind.lo src/graph/centrality/graph_closeness.lo src/graph/centrality/graph_eigentrust.lo src/graph/centrality/graph_eigenvector.lo src/graph/centrality/graph_hits.lo src/graph/centrality/graph_katz.lo src/graph/centrality/graph_pagerank.lo src/graph/centrality/graph_trust_transitivity.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/centrality/.libs/graph_betweenness.o src/graph/centrality/.libs/graph_centrality_bind.o src/graph/centrality/.libs/graph_closeness.o src/graph/centrality/.libs/graph_eigentrust.o src/graph/centrality/.libs/graph_eigenvector.o src/graph/centrality/.libs/graph_hits.o src/graph/centrality/.libs/graph_katz.o src/graph/centrality/.libs/graph_pagerank.o src/graph/centrality/.libs/graph_trust_transitivity.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_centrality.so -o .libs/libgraph_tool_centrality.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_centrality.la" && ln -s "../libgraph_tool_centrality.la" "libgraph_tool_centrality.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_clustering.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/clustering src/graph/clustering/graph_clustering.lo src/graph/clustering/graph_extended_clustering.lo src/graph/clustering/graph_motifs.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/clustering/.libs/graph_clustering.o src/graph/clustering/.libs/graph_extended_clustering.o src/graph/clustering/.libs/graph_motifs.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_clustering.so -o .libs/libgraph_tool_clustering.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_clustering.la" && ln -s "../libgraph_tool_clustering.la" "libgraph_tool_clustering.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_core.la -rpath /usr/lib/python3.13/dist-packages/graph_tool src/graph/base64.lo src/graph/demangle.lo src/graph/graph.lo src/graph/graph_exceptions.lo src/graph/graph_bind.lo src/graph/graph_copy.lo src/graph/graph_filtering.lo src/graph/graph_io.lo src/graph/graph_openmp.lo src/graph/graph_properties.lo src/graph/graph_properties_imp1.lo src/graph/graph_properties_imp2.lo src/graph/graph_properties_imp3.lo src/graph/graph_properties_imp4.lo src/graph/graph_properties_copy.lo src/graph/graph_properties_copy_imp1.lo src/graph/graph_properties_group.lo src/graph/graph_properties_ungroup.lo src/graph/graph_properties_map_values.lo src/graph/graph_properties_map_values_imp1.lo src/graph/graph_python_interface.lo src/graph/graph_python_interface_imp1.lo src/graph/graph_python_interface_export.lo src/graph/graph_selectors.lo src/graph/graphml.lo src/graph/openmp.lo src/graph/random.lo src/graph/read_graphviz_new.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/.libs/base64.o src/graph/.libs/demangle.o src/graph/.libs/graph.o src/graph/.libs/graph_exceptions.o src/graph/.libs/graph_bind.o src/graph/.libs/graph_copy.o src/graph/.libs/graph_filtering.o src/graph/.libs/graph_io.o src/graph/.libs/graph_openmp.o src/graph/.libs/graph_properties.o src/graph/.libs/graph_properties_imp1.o src/graph/.libs/graph_properties_imp2.o src/graph/.libs/graph_properties_imp3.o src/graph/.libs/graph_properties_imp4.o src/graph/.libs/graph_properties_copy.o src/graph/.libs/graph_properties_copy_imp1.o src/graph/.libs/graph_properties_group.o src/graph/.libs/graph_properties_ungroup.o src/graph/.libs/graph_properties_map_values.o src/graph/.libs/graph_properties_map_values_imp1.o src/graph/.libs/graph_python_interface.o src/graph/.libs/graph_python_interface_imp1.o src/graph/.libs/graph_python_interface_export.o src/graph/.libs/graph_selectors.o src/graph/.libs/graphml.o src/graph/.libs/openmp.o src/graph/.libs/random.o src/graph/.libs/read_graphviz_new.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_core.so -o .libs/libgraph_tool_core.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_core.la" && ln -s "../libgraph_tool_core.la" "libgraph_tool_core.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_correlations.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/correlations src/graph/correlations/graph_assortativity.lo src/graph/correlations/graph_correlations.lo src/graph/correlations/graph_correlations_imp1.lo src/graph/correlations/graph_avg_correlations.lo src/graph/correlations/graph_avg_correlations_imp1.lo src/graph/correlations/graph_avg_correlations_combined.lo src/graph/correlations/graph_correlations_combined.lo src/graph/correlations/graph_correlations_bind.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/correlations/.libs/graph_assortativity.o src/graph/correlations/.libs/graph_correlations.o src/graph/correlations/.libs/graph_correlations_imp1.o src/graph/correlations/.libs/graph_avg_correlations.o src/graph/correlations/.libs/graph_avg_correlations_imp1.o src/graph/correlations/.libs/graph_avg_correlations_combined.o src/graph/correlations/.libs/graph_correlations_combined.o src/graph/correlations/.libs/graph_correlations_bind.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_correlations.so -o .libs/libgraph_tool_correlations.so /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -lcairomm-1.0 -lsigc-2.0 -lcairo -Wl,-z,relro -Wl,-z,now -o libgraph_tool_draw.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/draw src/graph/draw/libgraph_tool_draw_la-graph_cairo_draw.lo src/graph/draw/libgraph_tool_draw_la-graph_tree_cts.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/draw/.libs/libgraph_tool_draw_la-graph_cairo_draw.o src/graph/draw/.libs/libgraph_tool_draw_la-graph_tree_cts.o -lcairomm-1.0 -lsigc-2.0 -lcairo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_draw.so -o .libs/libgraph_tool_draw.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_correlations.la" && ln -s "../libgraph_tool_correlations.la" "libgraph_tool_correlations.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_dynamics.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/dynamics src/graph/dynamics/graph_continuous.lo src/graph/dynamics/graph_discrete.lo src/graph/dynamics/graph_dynamics.lo src/graph/dynamics/graph_normal_bp.lo src/graph/dynamics/graph_potts_bp.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/dynamics/.libs/graph_continuous.o src/graph/dynamics/.libs/graph_discrete.o src/graph/dynamics/.libs/graph_dynamics.o src/graph/dynamics/.libs/graph_normal_bp.o src/graph/dynamics/.libs/graph_potts_bp.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_dynamics.so -o .libs/libgraph_tool_dynamics.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_draw.la" && ln -s "../libgraph_tool_draw.la" "libgraph_tool_draw.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_flow.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/flow src/graph/flow/graph_edmonds_karp.lo src/graph/flow/graph_push_relabel.lo src/graph/flow/graph_kolmogorov.lo src/graph/flow/graph_minimum_cut.lo src/graph/flow/graph_flow_bind.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/flow/.libs/graph_edmonds_karp.o src/graph/flow/.libs/graph_push_relabel.o src/graph/flow/.libs/graph_kolmogorov.o src/graph/flow/.libs/graph_minimum_cut.o src/graph/flow/.libs/graph_flow_bind.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_flow.so -o .libs/libgraph_tool_flow.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_dynamics.la" && ln -s "../libgraph_tool_dynamics.la" "libgraph_tool_dynamics.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_generation.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/generation src/graph/generation/libgraph_tool_generation_la-graph_community_network.lo src/graph/generation/libgraph_tool_generation_la-graph_community_network_eavg.lo src/graph/generation/libgraph_tool_generation_la-graph_community_network_eavg_imp1.lo src/graph/generation/libgraph_tool_generation_la-graph_community_network_edges.lo src/graph/generation/libgraph_tool_generation_la-graph_community_network_vavg.lo src/graph/generation/libgraph_tool_generation_la-graph_complete.lo src/graph/generation/libgraph_tool_generation_la-graph_contract_edges.lo src/graph/generation/libgraph_tool_generation_la-graph_generation.lo src/graph/generation/libgraph_tool_generation_la-graph_geometric.lo src/graph/generation/libgraph_tool_generation_la-graph_knn.lo src/graph/generation/libgraph_tool_generation_la-graph_lattice.lo src/graph/generation/libgraph_tool_generation_la-graph_line_graph.lo src/graph/generation/libgraph_tool_generation_la-graph_maxent_sbm.lo src/graph/generation/libgraph_tool_generation_la-graph_parallel.lo src/graph/generation/libgraph_tool_generation_la-graph_predecessor.lo src/graph/generation/libgraph_tool_generation_la-graph_price.lo src/graph/generation/libgraph_tool_generation_la-graph_random_edges.lo src/graph/generation/libgraph_tool_generation_la-graph_rewiring.lo src/graph/generation/libgraph_tool_generation_la-graph_sbm.lo src/graph/generation/libgraph_tool_generation_la-graph_triadic_closure.lo src/graph/generation/libgraph_tool_generation_la-graph_triangulation.lo src/graph/generation/libgraph_tool_generation_la-graph_union.lo src/graph/generation/libgraph_tool_generation_la-graph_union_eprop.lo src/graph/generation/libgraph_tool_generation_la-graph_union_vprop.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_eavg.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_eavg_imp1.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_edges.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_community_network_vavg.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_complete.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_contract_edges.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_generation.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_geometric.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_knn.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_lattice.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_line_graph.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_maxent_sbm.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_parallel.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_predecessor.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_price.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_random_edges.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_rewiring.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_sbm.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_triadic_closure.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_triangulation.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_union.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_union_eprop.o src/graph/generation/.libs/libgraph_tool_generation_la-graph_union_vprop.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_generation.so -o .libs/libgraph_tool_generation.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_flow.la" && ln -s "../libgraph_tool_flow.la" "libgraph_tool_flow.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_layout.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/draw src/graph/layout/graph_arf.lo src/graph/layout/graph_planar_layout.lo src/graph/layout/graph_fruchterman_reingold.lo src/graph/layout/graph_sfdp.lo src/graph/layout/graph_radial.lo src/graph/layout/graph_bind_layout.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/layout/.libs/graph_arf.o src/graph/layout/.libs/graph_planar_layout.o src/graph/layout/.libs/graph_fruchterman_reingold.o src/graph/layout/.libs/graph_sfdp.o src/graph/layout/.libs/graph_radial.o src/graph/layout/.libs/graph_bind_layout.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_layout.so -o .libs/libgraph_tool_layout.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_layout.la" && ln -s "../libgraph_tool_layout.la" "libgraph_tool_layout.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_search.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/search src/graph/search/graph_bfs.lo src/graph/search/graph_dfs.lo src/graph/search/graph_dijkstra.lo src/graph/search/graph_bellman_ford.lo src/graph/search/graph_astar.lo src/graph/search/graph_astar_implicit.lo src/graph/search/graph_search_bind.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/search/.libs/graph_bfs.o src/graph/search/.libs/graph_dfs.o src/graph/search/.libs/graph_dijkstra.o src/graph/search/.libs/graph_bellman_ford.o src/graph/search/.libs/graph_astar.o src/graph/search/.libs/graph_astar_implicit.o src/graph/search/.libs/graph_search_bind.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_search.so -o .libs/libgraph_tool_search.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_generation.la" && ln -s "../libgraph_tool_generation.la" "libgraph_tool_generation.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_spectral.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/spectral src/graph/spectral/graph_adjacency.lo src/graph/spectral/graph_incidence.lo src/graph/spectral/graph_laplacian.lo src/graph/spectral/graph_norm_laplacian.lo src/graph/spectral/graph_matrix.lo src/graph/spectral/graph_transition.lo src/graph/spectral/graph_nonbacktracking.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/spectral/.libs/graph_adjacency.o src/graph/spectral/.libs/graph_incidence.o src/graph/spectral/.libs/graph_laplacian.o src/graph/spectral/.libs/graph_norm_laplacian.o src/graph/spectral/.libs/graph_matrix.o src/graph/spectral/.libs/graph_transition.o src/graph/spectral/.libs/graph_nonbacktracking.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_spectral.so -o .libs/libgraph_tool_spectral.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_search.la" && ln -s "../libgraph_tool_search.la" "libgraph_tool_search.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_stats.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/stats src/graph/stats/graph_histograms.lo src/graph/stats/graph_average.lo src/graph/stats/graph_distance.lo src/graph/stats/graph_distance_sampled.lo src/graph/stats/graph_stats_bind.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/stats/.libs/graph_histograms.o src/graph/stats/.libs/graph_average.o src/graph/stats/.libs/graph_distance.o src/graph/stats/.libs/graph_distance_sampled.o src/graph/stats/.libs/graph_stats_bind.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_stats.so -o .libs/libgraph_tool_stats.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_spectral.la" && ln -s "../libgraph_tool_spectral.la" "libgraph_tool_spectral.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_topology.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/topology src/graph/topology/graph_all_circuits.lo src/graph/topology/graph_all_distances.lo src/graph/topology/graph_bipartite.lo src/graph/topology/graph_components.lo src/graph/topology/graph_distance.lo src/graph/topology/graph_diameter.lo src/graph/topology/graph_dominator_tree.lo src/graph/topology/graph_isomorphism.lo src/graph/topology/graph_kcore.lo src/graph/topology/graph_matching.lo src/graph/topology/graph_maximal_cliques.lo src/graph/topology/graph_maximal_planar.lo src/graph/topology/graph_maximal_vertex_set.lo src/graph/topology/graph_minimum_spanning_tree.lo src/graph/topology/graph_percolation.lo src/graph/topology/graph_planar.lo src/graph/topology/graph_random_matching.lo src/graph/topology/graph_random_spanning_tree.lo src/graph/topology/graph_reciprocity.lo src/graph/topology/graph_sequential_color.lo src/graph/topology/graph_similarity.lo src/graph/topology/graph_similarity_imp.lo src/graph/topology/graph_subgraph_isomorphism.lo src/graph/topology/graph_topological_sort.lo src/graph/topology/graph_topology.lo src/graph/topology/graph_tsp.lo src/graph/topology/graph_transitive_closure.lo src/graph/topology/graph_vertex_similarity.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/topology/.libs/graph_all_circuits.o src/graph/topology/.libs/graph_all_distances.o src/graph/topology/.libs/graph_bipartite.o src/graph/topology/.libs/graph_components.o src/graph/topology/.libs/graph_distance.o src/graph/topology/.libs/graph_diameter.o src/graph/topology/.libs/graph_dominator_tree.o src/graph/topology/.libs/graph_isomorphism.o src/graph/topology/.libs/graph_kcore.o src/graph/topology/.libs/graph_matching.o src/graph/topology/.libs/graph_maximal_cliques.o src/graph/topology/.libs/graph_maximal_planar.o src/graph/topology/.libs/graph_maximal_vertex_set.o src/graph/topology/.libs/graph_minimum_spanning_tree.o src/graph/topology/.libs/graph_percolation.o src/graph/topology/.libs/graph_planar.o src/graph/topology/.libs/graph_random_matching.o src/graph/topology/.libs/graph_random_spanning_tree.o src/graph/topology/.libs/graph_reciprocity.o src/graph/topology/.libs/graph_sequential_color.o src/graph/topology/.libs/graph_similarity.o src/graph/topology/.libs/graph_similarity_imp.o src/graph/topology/.libs/graph_subgraph_isomorphism.o src/graph/topology/.libs/graph_topological_sort.o src/graph/topology/.libs/graph_topology.o src/graph/topology/.libs/graph_tsp.o src/graph/topology/.libs/graph_transitive_closure.o src/graph/topology/.libs/graph_vertex_similarity.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_topology.so -o .libs/libgraph_tool_topology.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_stats.la" && ln -s "../libgraph_tool_stats.la" "libgraph_tool_stats.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_util.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/util src/graph/util/graph_search.lo src/graph/util/graph_util_bind.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/util/.libs/graph_search.o src/graph/util/.libs/graph_util_bind.o -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_util.so -o .libs/libgraph_tool_util.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_util.la" && ln -s "../libgraph_tool_util.la" "libgraph_tool_util.la" ) libtool: link: ( cd ".libs" && rm -f "libgraph_tool_topology.la" && ln -s "../libgraph_tool_topology.la" "libgraph_tool_topology.la" ) /bin/bash ./libtool --tag=CXX --mode=link g++ -std=gnu++17 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -module -avoid-version -export-dynamic -no-undefined -Wl,-E -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -o libgraph_tool_inference.la -rpath /usr/lib/python3.13/dist-packages/graph_tool/inference src/graph/inference/blockmodel/graph_blockmodel.lo src/graph/inference/blockmodel/graph_blockmodel_em.lo src/graph/inference/blockmodel/graph_blockmodel_exhaustive.lo src/graph/inference/blockmodel/graph_blockmodel_gibbs.lo src/graph/inference/blockmodel/graph_blockmodel_imp.lo src/graph/inference/blockmodel/graph_blockmodel_imp2.lo src/graph/inference/blockmodel/graph_blockmodel_imp3.lo src/graph/inference/blockmodel/graph_blockmodel_marginals.lo src/graph/inference/blockmodel/graph_blockmodel_mcmc.lo src/graph/inference/blockmodel/graph_blockmodel_multicanonical.lo src/graph/inference/blockmodel/graph_blockmodel_multicanonical_multiflip.lo src/graph/inference/blockmodel/graph_blockmodel_multiflip_mcmc.lo src/graph/inference/blockmodel/graph_blockmodel_multilevel_mcmc.lo src/graph/inference/cliques/graph_clique_decomposition.lo src/graph/inference/histogram/graph_histogram.lo src/graph/inference/histogram/graph_histogram_mcmc.lo src/graph/inference/modularity/graph_modularity.lo src/graph/inference/modularity/graph_modularity_gibbs.lo src/graph/inference/modularity/graph_modularity_mcmc.lo src/graph/inference/modularity/graph_modularity_multiflip_mcmc.lo src/graph/inference/modularity/graph_modularity_multilevel_mcmc.lo src/graph/inference/norm_cut/graph_norm_cut.lo src/graph/inference/norm_cut/graph_norm_cut_gibbs.lo src/graph/inference/norm_cut/graph_norm_cut_mcmc.lo src/graph/inference/norm_cut/graph_norm_cut_multiflip_mcmc.lo src/graph/inference/norm_cut/graph_norm_cut_multilevel_mcmc.lo src/graph/inference/partition_centroid/graph_partition_centroid.lo src/graph/inference/partition_centroid/graph_partition_centroid_mcmc.lo src/graph/inference/partition_centroid/graph_partition_centroid_multiflip_mcmc.lo src/graph/inference/partition_centroid/graph_partition_centroid_multilevel_mcmc.lo src/graph/inference/partition_centroid/graph_partition_centroid_rmi.lo src/graph/inference/partition_centroid/graph_partition_centroid_rmi_mcmc.lo src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multiflip_mcmc.lo src/graph/inference/partition_centroid/graph_partition_centroid_rmi_multilevel_mcmc.lo src/graph/inference/partition_modes/graph_partition_mode.lo src/graph/inference/partition_modes/graph_partition_mode_clustering.lo src/graph/inference/partition_modes/graph_partition_mode_clustering_mcmc.lo src/graph/inference/partition_modes/graph_partition_mode_clustering_multiflip_mcmc.lo src/graph/inference/partition_modes/graph_partition_mode_clustering_multilevel_mcmc.lo src/graph/inference/planted_partition/graph_planted_partition.lo src/graph/inference/planted_partition/graph_planted_partition_gibbs.lo src/graph/inference/planted_partition/graph_planted_partition_mcmc.lo src/graph/inference/planted_partition/graph_planted_partition_multiflip_mcmc.lo src/graph/inference/planted_partition/graph_planted_partition_multilevel_mcmc.lo src/graph/inference/overlap/graph_blockmodel_overlap.lo src/graph/inference/overlap/graph_blockmodel_overlap_exhaustive.lo src/graph/inference/overlap/graph_blockmodel_overlap_gibbs.lo src/graph/inference/overlap/graph_blockmodel_overlap_mcmc.lo src/graph/inference/overlap/graph_blockmodel_overlap_mcmc_bundled.lo src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical.lo src/graph/inference/overlap/graph_blockmodel_overlap_multicanonical_multiflip.lo src/graph/inference/overlap/graph_blockmodel_overlap_multiflip_mcmc.lo src/graph/inference/overlap/graph_blockmodel_overlap_multilevel_mcmc.lo src/graph/inference/overlap/graph_blockmodel_overlap_vacate.lo src/graph/inference/layers/graph_blockmodel_layers.lo src/graph/inference/layers/graph_blockmodel_layers_exhaustive.lo src/graph/inference/layers/graph_blockmodel_layers_gibbs.lo src/graph/inference/layers/graph_blockmodel_layers_imp.lo src/graph/inference/layers/graph_blockmodel_layers_mcmc.lo src/graph/inference/layers/graph_blockmodel_layers_multicanonical.lo src/graph/inference/layers/graph_blockmodel_layers_multicanonical_multiflip.lo src/graph/inference/layers/graph_blockmodel_layers_multiflip_mcmc.lo src/graph/inference/layers/graph_blockmodel_layers_multilevel_mcmc.lo src/graph/inference/layers/graph_blockmodel_layers_overlap.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_exhaustive.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_gibbs.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_mcmc_bundled.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_multicanonical_multiflip.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_multiflip_mcmc.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_multilevel_mcmc.lo src/graph/inference/layers/graph_blockmodel_layers_overlap_vacate.lo src/graph/inference/ranked/graph_ranked.lo src/graph/inference/ranked/graph_ranked_mcmc.lo src/graph/inference/ranked/graph_ranked_gibbs.lo src/graph/inference/ranked/graph_ranked_multiflip_mcmc.lo src/graph/inference/ranked/graph_ranked_multilevel_mcmc.lo src/graph/inference/uncertain/dynamics/dynamics.lo src/graph/inference/uncertain/dynamics/dynamics_mcmc.lo src/graph/inference/uncertain/dynamics/dynamics_swap_mcmc.lo src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc.lo src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc_theta.lo src/graph/inference/uncertain/dynamics/dynamics_mcmc_theta.lo src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc.lo src/graph/inference/uncertain/dynamics/dynamics_parallel_mcmc_theta.lo src/graph/inference/uncertain/dynamics/dynamics_parallel_swap_mcmc.lo src/graph/inference/uncertain/dynamics/cising_glauber/state.lo src/graph/inference/uncertain/dynamics/epidemics/state.lo src/graph/inference/uncertain/dynamics/ising_glauber/state.lo src/graph/inference/uncertain/dynamics/linear_normal/state.lo src/graph/inference/uncertain/dynamics/lotka_volterra/state.lo src/graph/inference/uncertain/dynamics/normal_glauber/state.lo src/graph/inference/uncertain/dynamics/pseudo_cising/state.lo src/graph/inference/uncertain/dynamics/pseudo_ising/state.lo src/graph/inference/uncertain/dynamics/pseudo_normal/state.lo src/graph/inference/uncertain/latent_closure.lo src/graph/inference/uncertain/latent_closure_mcmc.lo src/graph/inference/uncertain/measured.lo src/graph/inference/uncertain/measured_mcmc.lo src/graph/inference/uncertain/uncertain.lo src/graph/inference/uncertain/uncertain_marginal.lo src/graph/inference/uncertain/uncertain_mcmc.lo src/graph/inference/support/cache.lo src/graph/inference/support/int_part.lo src/graph/inference/support/spence.lo src/graph/inference/graph_inference.lo src/graph/inference/graph_latent_multigraph.lo src/graph/inference/graph_modularity.lo -L/usr/lib/x86_64-linux-gnu -lpython3.13 -L/usr/lib/x86_64-linux-gnu -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat libgraph_tool_inference_fast.la -lgmp -lgmp libtool: link: g++ -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crti.o /usr/lib/gcc/x86_64-linux-gnu/14/crtbeginS.o src/graph/inference/blockmodel/.libs/graph_blockmodel.o src/graph/inference/blockmodel/.libs/graph_blockmodel_em.o src/graph/inference/blockmodel/.libs/graph_blockmodel_exhaustive.o src/graph/inference/blockmodel/.libs/graph_blockmodel_gibbs.o src/graph/inference/blockmodel/.libs/graph_blockmodel_imp.o src/graph/inference/blockmodel/.libs/graph_blockmodel_imp2.o src/graph/inference/blockmodel/.libs/graph_blockmodel_imp3.o src/graph/inference/blockmodel/.libs/graph_blockmodel_marginals.o src/graph/inference/blockmodel/.libs/graph_blockmodel_mcmc.o src/graph/inference/blockmodel/.libs/graph_blockmodel_multicanonical.o src/graph/inference/blockmodel/.libs/graph_blockmodel_multicanonical_multiflip.o src/graph/inference/blockmodel/.libs/graph_blockmodel_multiflip_mcmc.o src/graph/inference/blockmodel/.libs/graph_blockmodel_multilevel_mcmc.o src/graph/inference/cliques/.libs/graph_clique_decomposition.o src/graph/inference/histogram/.libs/graph_histogram.o src/graph/inference/histogram/.libs/graph_histogram_mcmc.o src/graph/inference/modularity/.libs/graph_modularity.o src/graph/inference/modularity/.libs/graph_modularity_gibbs.o src/graph/inference/modularity/.libs/graph_modularity_mcmc.o src/graph/inference/modularity/.libs/graph_modularity_multiflip_mcmc.o src/graph/inference/modularity/.libs/graph_modularity_multilevel_mcmc.o src/graph/inference/norm_cut/.libs/graph_norm_cut.o src/graph/inference/norm_cut/.libs/graph_norm_cut_gibbs.o src/graph/inference/norm_cut/.libs/graph_norm_cut_mcmc.o src/graph/inference/norm_cut/.libs/graph_norm_cut_multiflip_mcmc.o src/graph/inference/norm_cut/.libs/graph_norm_cut_multilevel_mcmc.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_mcmc.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_multiflip_mcmc.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_multilevel_mcmc.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi_mcmc.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi_multiflip_mcmc.o src/graph/inference/partition_centroid/.libs/graph_partition_centroid_rmi_multilevel_mcmc.o src/graph/inference/partition_modes/.libs/graph_partition_mode.o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering.o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering_mcmc.o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering_multiflip_mcmc.o src/graph/inference/partition_modes/.libs/graph_partition_mode_clustering_multilevel_mcmc.o src/graph/inference/planted_partition/.libs/graph_planted_partition.o src/graph/inference/planted_partition/.libs/graph_planted_partition_gibbs.o src/graph/inference/planted_partition/.libs/graph_planted_partition_mcmc.o src/graph/inference/planted_partition/.libs/graph_planted_partition_multiflip_mcmc.o src/graph/inference/planted_partition/.libs/graph_planted_partition_multilevel_mcmc.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_exhaustive.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_gibbs.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_mcmc.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_mcmc_bundled.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multicanonical.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multicanonical_multiflip.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multiflip_mcmc.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_multilevel_mcmc.o src/graph/inference/overlap/.libs/graph_blockmodel_overlap_vacate.o src/graph/inference/layers/.libs/graph_blockmodel_layers.o src/graph/inference/layers/.libs/graph_blockmodel_layers_exhaustive.o src/graph/inference/layers/.libs/graph_blockmodel_layers_gibbs.o src/graph/inference/layers/.libs/graph_blockmodel_layers_imp.o src/graph/inference/layers/.libs/graph_blockmodel_layers_mcmc.o src/graph/inference/layers/.libs/graph_blockmodel_layers_multicanonical.o src/graph/inference/layers/.libs/graph_blockmodel_layers_multicanonical_multiflip.o src/graph/inference/layers/.libs/graph_blockmodel_layers_multiflip_mcmc.o src/graph/inference/layers/.libs/graph_blockmodel_layers_multilevel_mcmc.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_exhaustive.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_gibbs.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_mcmc.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_mcmc_bundled.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multicanonical.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multicanonical_multiflip.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multiflip_mcmc.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_multilevel_mcmc.o src/graph/inference/layers/.libs/graph_blockmodel_layers_overlap_vacate.o src/graph/inference/ranked/.libs/graph_ranked.o src/graph/inference/ranked/.libs/graph_ranked_mcmc.o src/graph/inference/ranked/.libs/graph_ranked_gibbs.o src/graph/inference/ranked/.libs/graph_ranked_multiflip_mcmc.o src/graph/inference/ranked/.libs/graph_ranked_multilevel_mcmc.o src/graph/inference/uncertain/dynamics/.libs/dynamics.o src/graph/inference/uncertain/dynamics/.libs/dynamics_mcmc.o src/graph/inference/uncertain/dynamics/.libs/dynamics_swap_mcmc.o src/graph/inference/uncertain/dynamics/.libs/dynamics_multiflip_mcmc.o src/graph/inference/uncertain/dynamics/.libs/dynamics_multiflip_mcmc_theta.o src/graph/inference/uncertain/dynamics/.libs/dynamics_mcmc_theta.o src/graph/inference/uncertain/dynamics/.libs/dynamics_parallel_mcmc.o src/graph/inference/uncertain/dynamics/.libs/dynamics_parallel_mcmc_theta.o src/graph/inference/uncertain/dynamics/.libs/dynamics_parallel_swap_mcmc.o src/graph/inference/uncertain/dynamics/cising_glauber/.libs/state.o src/graph/inference/uncertain/dynamics/epidemics/.libs/state.o src/graph/inference/uncertain/dynamics/ising_glauber/.libs/state.o src/graph/inference/uncertain/dynamics/linear_normal/.libs/state.o src/graph/inference/uncertain/dynamics/lotka_volterra/.libs/state.o src/graph/inference/uncertain/dynamics/normal_glauber/.libs/state.o src/graph/inference/uncertain/dynamics/pseudo_cising/.libs/state.o src/graph/inference/uncertain/dynamics/pseudo_ising/.libs/state.o src/graph/inference/uncertain/dynamics/pseudo_normal/.libs/state.o src/graph/inference/uncertain/.libs/latent_closure.o src/graph/inference/uncertain/.libs/latent_closure_mcmc.o src/graph/inference/uncertain/.libs/measured.o src/graph/inference/uncertain/.libs/measured_mcmc.o src/graph/inference/uncertain/.libs/uncertain.o src/graph/inference/uncertain/.libs/uncertain_marginal.o src/graph/inference/uncertain/.libs/uncertain_mcmc.o src/graph/inference/support/.libs/cache.o src/graph/inference/support/.libs/int_part.o src/graph/inference/support/.libs/spence.o src/graph/inference/.libs/graph_inference.o src/graph/inference/.libs/graph_latent_multigraph.o src/graph/inference/.libs/graph_modularity.o -Wl,--whole-archive ./.libs/libgraph_tool_inference_fast.a -Wl,--no-whole-archive -L/usr/lib/x86_64-linux-gnu -lpython3.13 -lboost_iostreams -lboost_python313 -lboost_regex -lboost_context -lboost_coroutine -lexpat -lgmp -L/usr/lib/gcc/x86_64-linux-gnu/14 -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu -L/usr/lib/gcc/x86_64-linux-gnu/14/../../../../lib -L/lib/x86_64-linux-gnu -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-linux-gnu/14/../../.. -lstdc++ -lm -lc -lgcc_s /usr/lib/gcc/x86_64-linux-gnu/14/crtendS.o /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/crtn.o -fopenmp -O3 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -Werror=format-security -Wl,-E -Wl,--as-needed -Wl,-z -Wl,relro -Wl,-z -Wl,now -fopenmp -Wl,-soname -Wl,libgraph_tool_inference.so -o .libs/libgraph_tool_inference.so libtool: link: ( cd ".libs" && rm -f "libgraph_tool_inference.la" && ln -s "../libgraph_tool_inference.la" "libgraph_tool_inference.la" ) make[3]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' make[2]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' make[1]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds' rm -f debian/graph-tool-doc.debhelper.log debian/python3-graph-tool.debhelper.log debian/rules override_dh_auto_test make[1]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds' true make[1]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds' create-stamp debian/debhelper-build-stamp dh_testroot -O--builddirectory=_BUILD dh_prep -O--builddirectory=_BUILD rm -f -- debian/python3-graph-tool.substvars debian/graph-tool-doc.substvars rm -fr -- debian/.debhelper/generated/python3-graph-tool/ debian/python3-graph-tool/ debian/tmp/ debian/.debhelper/generated/graph-tool-doc/ debian/graph-tool-doc/ debian/rules override_dh_auto_install make[1]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds' dh_auto_install install -m0755 -d /build/reproducible-path/graph-tool-2.77\+ds/debian/tmp cd _BUILD && make -j1 install DESTDIR=/build/reproducible-path/graph-tool-2.77\+ds/debian/tmp AM_UPDATE_INFO_DIR=no make[2]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' make[3]: Entering directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' make[3]: Nothing to be done for 'install-exec-am'. /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference' /usr/bin/install -c -m 644 ../src/graph/inference/graph_modularity.hh ../src/graph/inference/graph_latent_multigraph.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/blockmodel' /usr/bin/install -c -m 644 ../src/graph/inference/blockmodel/graph_blockmodel.hh ../src/graph/inference/blockmodel/graph_blockmodel_em.hh ../src/graph/inference/blockmodel/graph_blockmodel_emat.hh ../src/graph/inference/blockmodel/graph_blockmodel_elist.hh ../src/graph/inference/blockmodel/graph_blockmodel_entries.hh ../src/graph/inference/blockmodel/graph_blockmodel_entropy.hh ../src/graph/inference/blockmodel/graph_blockmodel_exhaustive.hh ../src/graph/inference/blockmodel/graph_blockmodel_gibbs.hh ../src/graph/inference/blockmodel/graph_blockmodel_mcmc.hh ../src/graph/inference/blockmodel/graph_blockmodel_multicanonical.hh ../src/graph/inference/blockmodel/graph_blockmodel_multiflip_mcmc.hh ../src/graph/inference/blockmodel/graph_blockmodel_multilevel_mcmc.hh ../src/graph/inference/blockmodel/graph_blockmodel_partition.hh ../src/graph/inference/blockmodel/graph_blockmodel_util.hh ../src/graph/inference/blockmodel/graph_blockmodel_weights.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/blockmodel' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/cliques' /usr/bin/install -c -m 644 ../src/graph/inference/cliques/graph_clique_decomposition.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/cliques' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/histogram' /usr/bin/install -c -m 644 ../src/graph/inference/histogram/graph_histogram.hh ../src/graph/inference/histogram/graph_histogram_mcmc.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/histogram' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/layers' /usr/bin/install -c -m 644 ../src/graph/inference/layers/graph_blockmodel_layers.hh ../src/graph/inference/layers/graph_blockmodel_layers_util.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/layers' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/loops' /usr/bin/install -c -m 644 ../src/graph/inference/loops/bundled_vacate_loop.hh ../src/graph/inference/loops/exhaustive_loop.hh ../src/graph/inference/loops/gibbs_loop.hh ../src/graph/inference/loops/mcmc_loop.hh ../src/graph/inference/loops/merge_split.hh ../src/graph/inference/loops/multilevel.hh ../src/graph/inference/loops/parallel_pseudo_mcmc.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/loops' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/modularity' /usr/bin/install -c -m 644 ../src/graph/inference/modularity/graph_modularity.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/modularity' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/norm_cut' /usr/bin/install -c -m 644 ../src/graph/inference/norm_cut/graph_norm_cut.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/norm_cut' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/overlap' /usr/bin/install -c -m 644 ../src/graph/inference/overlap/graph_blockmodel_overlap.hh ../src/graph/inference/overlap/graph_blockmodel_overlap_mcmc_bundled.hh ../src/graph/inference/overlap/graph_blockmodel_overlap_util.hh ../src/graph/inference/overlap/graph_blockmodel_overlap_vacate.hh ../src/graph/inference/overlap/graph_blockmodel_overlap_partition.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/overlap' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/partition_centroid' /usr/bin/install -c -m 644 ../src/graph/inference/partition_centroid/graph_partition_centroid.hh ../src/graph/inference/partition_centroid/graph_partition_centroid_rmi.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/partition_centroid' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/partition_modes' /usr/bin/install -c -m 644 ../src/graph/inference/partition_modes/graph_partition_mode.hh ../src/graph/inference/partition_modes/graph_partition_mode_clustering.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/partition_modes' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/planted_partition' /usr/bin/install -c -m 644 ../src/graph/inference/planted_partition/graph_planted_partition.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/planted_partition' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/ranked' /usr/bin/install -c -m 644 ../src/graph/inference/ranked/graph_ranked.hh ../src/graph/inference/ranked/graph_ranked_mcmc.hh ../src/graph/inference/ranked/graph_ranked_gibbs.hh ../src/graph/inference/ranked/graph_ranked_multiflip_mcmc.hh ../src/graph/inference/ranked/graph_ranked_multilevel_mcmc.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/ranked' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/support' /usr/bin/install -c -m 644 ../src/graph/inference/support/cache.hh ../src/graph/inference/support/contingency.hh ../src/graph/inference/support/fibonacci_search.hh ../src/graph/inference/support/graph_state.hh ../src/graph/inference/support/int_part.hh ../src/graph/inference/support/util.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/support' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/uncertain' /usr/bin/install -c -m 644 ../src/graph/inference/uncertain/dynamics/dynamics.hh ../src/graph/inference/uncertain/dynamics/dynamics_imp.hh ../src/graph/inference/uncertain/dynamics/dynamics_base.hh ../src/graph/inference/uncertain/dynamics/dynamics_base_imp.hh ../src/graph/inference/uncertain/dynamics/dynamics_continuous.hh ../src/graph/inference/uncertain/dynamics/dynamics_discrete.hh ../src/graph/inference/uncertain/dynamics/dynamics_mcmc.hh ../src/graph/inference/uncertain/dynamics/dynamics_swap_mcmc.hh ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc.hh ../src/graph/inference/uncertain/dynamics/dynamics_multiflip_mcmc_theta.hh ../src/graph/inference/uncertain/dynamics/dynamics_mcmc_theta.hh ../src/graph/inference/uncertain/dynamics/dynamics_util.hh ../src/graph/inference/uncertain/dynamics/segment_sampler.hh ../src/graph/inference/uncertain/latent_closure.hh ../src/graph/inference/uncertain/latent_layers.hh ../src/graph/inference/uncertain/latent_layers_mcmc.hh ../src/graph/inference/uncertain/measured.hh ../src/graph/inference/uncertain/uncertain.hh ../src/graph/inference/uncertain/uncertain_marginal.hh ../src/graph/inference/uncertain/uncertain_mcmc.hh ../src/graph/inference/uncertain/uncertain_util.hh ../src/graph/inference/uncertain/sample_edge_sbm.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/inference/uncertain' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/collection' /usr/bin/install -c -m 644 ../src/graph_tool/collection/atlas.dat.gz ../src/graph_tool/collection/adjnoun.gt.gz ../src/graph_tool/collection/as-22july06.gt.gz ../src/graph_tool/collection/astro-ph.gt.gz ../src/graph_tool/collection/celegansneural.gt.gz ../src/graph_tool/collection/cond-mat-2003.gt.gz ../src/graph_tool/collection/cond-mat-2005.gt.gz ../src/graph_tool/collection/cond-mat.gt.gz ../src/graph_tool/collection/dolphins.gt.gz ../src/graph_tool/collection/football.gt.gz ../src/graph_tool/collection/hep-th.gt.gz ../src/graph_tool/collection/karate.gt.gz ../src/graph_tool/collection/lesmis.gt.gz ../src/graph_tool/collection/netscience.gt.gz ../src/graph_tool/collection/polblogs.gt.gz ../src/graph_tool/collection/polbooks.gt.gz ../src/graph_tool/collection/power.gt.gz ../src/graph_tool/collection/pgp-strong-2009.gt.gz ../src/graph_tool/collection/serengeti-foodweb.gt.gz ../src/graph_tool/collection/email-Enron.gt.gz '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/collection' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' /usr/bin/install -c -m 644 ../src/graph_tool/draw/graph-tool-logo.svg '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool' /usr/bin/install -c -m 644 ../src/graph_tool/__init__.py ../src/graph_tool/all.py ../src/graph_tool/dl_import.py ../src/graph_tool/decorators.py ../src/graph_tool/gt_io.py ../src/graph_tool/openmp.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool' Byte-compiling python modules... __init__.pyall.pydl_import.pydecorators.pygt_io.pyopenmp.py Byte-compiling python modules (optimized versions) ... __init__.pyall.pydl_import.pydecorators.pygt_io.pyopenmp.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/centrality' /usr/bin/install -c -m 644 ../src/graph_tool/centrality/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/centrality' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/clustering' /usr/bin/install -c -m 644 ../src/graph_tool/clustering/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/clustering' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/collection' /usr/bin/install -c -m 644 ../src/graph_tool/collection/__init__.py ../src/graph_tool/collection/netzschleuder.py ../src/graph_tool/collection/small.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/collection' Byte-compiling python modules... __init__.pynetzschleuder.pysmall.py Byte-compiling python modules (optimized versions) ... __init__.pynetzschleuder.pysmall.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/correlations' /usr/bin/install -c -m 644 ../src/graph_tool/correlations/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/correlations' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' /usr/bin/install -c -m 644 ../src/graph_tool/draw/__init__.py ../src/graph_tool/draw/cairo_draw.py ../src/graph_tool/draw/gtk_draw.py ../src/graph_tool/draw/graphviz_draw.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' Byte-compiling python modules... __init__.pycairo_draw.pygtk_draw.pygraphviz_draw.py Byte-compiling python modules (optimized versions) ... __init__.pycairo_draw.pygtk_draw.pygraphviz_draw.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/dynamics' /usr/bin/install -c -m 644 ../src/graph_tool/dynamics/__init__.py ../src/graph_tool/dynamics/bp.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/dynamics' Byte-compiling python modules... __init__.pybp.py Byte-compiling python modules (optimized versions) ... __init__.pybp.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/flow' /usr/bin/install -c -m 644 ../src/graph_tool/flow/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/flow' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/generation' /usr/bin/install -c -m 644 ../src/graph_tool/generation/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/generation' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/inference' /usr/bin/install -c -m 644 ../src/graph_tool/inference/__init__.py ../src/graph_tool/inference/base_states.py ../src/graph_tool/inference/blockmodel.py ../src/graph_tool/inference/blockmodel_em.py ../src/graph_tool/inference/clique_decomposition.py ../src/graph_tool/inference/histogram.py ../src/graph_tool/inference/layered_blockmodel.py ../src/graph_tool/inference/nested_blockmodel.py ../src/graph_tool/inference/overlap_blockmodel.py ../src/graph_tool/inference/uncertain_blockmodel.py ../src/graph_tool/inference/reconstruction.py ../src/graph_tool/inference/mcmc.py ../src/graph_tool/inference/minimize.py ../src/graph_tool/inference/modularity.py ../src/graph_tool/inference/norm_cut.py ../src/graph_tool/inference/partition_centroid.py ../src/graph_tool/inference/partition_modes.py ../src/graph_tool/inference/planted_partition.py ../src/graph_tool/inference/ranked.py ../src/graph_tool/inference/latent_multigraph.py ../src/graph_tool/inference/latent_layers.py ../src/graph_tool/inference/util.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/inference' Byte-compiling python modules... __init__.pybase_states.pyblockmodel.pyblockmodel_em.pyclique_decomposition.pyhistogram.pylayered_blockmodel.pynested_blockmodel.pyoverlap_blockmodel.pyuncertain_blockmodel.pyreconstruction.pymcmc.pyminimize.pymodularity.pynorm_cut.pypartition_centroid.pypartition_modes.pyplanted_partition.pyranked.pylatent_multigraph.pylatent_layers.pyutil.py Byte-compiling python modules (optimized versions) ... __init__.pybase_states.pyblockmodel.pyblockmodel_em.pyclique_decomposition.pyhistogram.pylayered_blockmodel.pynested_blockmodel.pyoverlap_blockmodel.pyuncertain_blockmodel.pyreconstruction.pymcmc.pyminimize.pymodularity.pynorm_cut.pypartition_centroid.pypartition_modes.pyplanted_partition.pyranked.pylatent_multigraph.pylatent_layers.pyutil.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/search' /usr/bin/install -c -m 644 ../src/graph_tool/search/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/search' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/spectral' /usr/bin/install -c -m 644 ../src/graph_tool/spectral/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/spectral' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/stats' /usr/bin/install -c -m 644 ../src/graph_tool/stats/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/stats' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/topology' /usr/bin/install -c -m 644 ../src/graph_tool/topology/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/topology' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/util' /usr/bin/install -c -m 644 ../src/graph_tool/util/__init__.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/util' Byte-compiling python modules... __init__.py Byte-compiling python modules (optimized versions) ... __init__.py /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/centrality' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_centrality.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/centrality' libtool: install: /usr/bin/install -c .libs/libgraph_tool_centrality.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/centrality/libgraph_tool_centrality.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_centrality.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/centrality/libgraph_tool_centrality.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/centrality' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/centrality' /usr/bin/install -c -m 644 ../src/graph/centrality/graph_closeness.hh ../src/graph/centrality/graph_eigentrust.hh ../src/graph/centrality/graph_eigenvector.hh ../src/graph/centrality/graph_pagerank.hh ../src/graph/centrality/graph_hits.hh ../src/graph/centrality/graph_katz.hh ../src/graph/centrality/graph_trust_transitivity.hh ../src/graph/centrality/minmax.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/centrality' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/clustering' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_clustering.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/clustering' libtool: install: /usr/bin/install -c .libs/libgraph_tool_clustering.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/clustering/libgraph_tool_clustering.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_clustering.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/clustering/libgraph_tool_clustering.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/clustering' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/clustering' /usr/bin/install -c -m 644 ../src/graph/clustering/graph_clustering.hh ../src/graph/clustering/graph_extended_clustering.hh ../src/graph/clustering/graph_motifs.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/clustering' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_core.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool' libtool: install: /usr/bin/install -c .libs/libgraph_tool_core.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/libgraph_tool_core.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_core.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/libgraph_tool_core.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include' /usr/bin/install -c -m 644 config.h ../src/graph/base64.hh ../src/graph/coroutine.hh ../src/graph/demangle.hh ../src/graph/fast_vector_property_map.hh ../src/graph/gml.hh ../src/graph/gil_release.hh ../src/graph/graph.hh ../src/graph/graph_adjacency.hh ../src/graph/graph_adaptor.hh ../src/graph/graph_exceptions.hh ../src/graph/graph_filtered.hh ../src/graph/graph_filtering.hh ../src/graph/graph_io_binary.hh ../src/graph/graph_properties.hh ../src/graph/graph_properties_copy.hh ../src/graph/graph_properties_group.hh ../src/graph/graph_properties_map_values.hh ../src/graph/graph_python_interface.hh ../src/graph/graph_reverse.hh ../src/graph/graph_selectors.hh ../src/graph/graph_tool.hh ../src/graph/graph_util.hh ../src/graph/hash_map_wrap.hh ../src/graph/histogram.hh ../src/graph/idx_map.hh ../src/graph/module_registry.hh ../src/graph/mpl_nested_loop.hh ../src/graph/numpy_bind.hh ../src/graph/openmp.hh ../src/graph/openmp_lock.hh ../src/graph/parallel_rng.hh ../src/graph/random.hh ../src/graph/str_repr.hh ../src/graph/shared_map.hh ../src/graph/shared_heap.hh ../src/graph/transform_iterator.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/pcg-cpp' /usr/bin/install -c -m 644 ../src/pcg-cpp/include/pcg_extras.hpp ../src/pcg-cpp/include/pcg_random.hpp ../src/pcg-cpp/include/pcg_uint128.hpp '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/pcg-cpp' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/boost-workaround/boost/graph/' /usr/bin/install -c -m 644 ../src/boost-workaround/boost/graph/adjacency_iterator.hpp ../src/boost-workaround/boost/graph/betweenness_centrality.hpp ../src/boost-workaround/boost/graph/detail/read_graphviz_new.hpp ../src/boost-workaround/boost/graph/graphml.hpp ../src/boost-workaround/boost/graph/graphviz.hpp ../src/boost-workaround/boost/graph/hawick_circuits.hpp ../src/boost-workaround/boost/graph/kamada_kawai_spring_layout.hpp ../src/boost-workaround/boost/graph/maximum_weighted_matching.hpp ../src/boost-workaround/boost/graph/metric_tsp_approx.hpp ../src/boost-workaround/boost/graph/named_function_params-alt.hpp ../src/boost-workaround/boost/graph/overloading.hpp ../src/boost-workaround/boost/graph/push_relabel_max_flow.hpp ../src/boost-workaround/boost/graph/copy_alt.hpp ../src/boost-workaround/boost/graph/stoer_wagner_min_cut.hpp ../src/boost-workaround/boost/graph/vf2_sub_graph_iso.hpp '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/boost-workaround/boost/graph/' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/correlations' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_correlations.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/correlations' libtool: install: /usr/bin/install -c .libs/libgraph_tool_correlations.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/correlations/libgraph_tool_correlations.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_correlations.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/correlations/libgraph_tool_correlations.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/correlations' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/correlations' /usr/bin/install -c -m 644 ../src/graph/correlations/graph_assortativity.hh ../src/graph/correlations/graph_correlations.hh ../src/graph/correlations/graph_corr_hist.hh ../src/graph/correlations/graph_avg_correlations.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/correlations' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_draw.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' libtool: install: /usr/bin/install -c .libs/libgraph_tool_draw.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/libgraph_tool_draw.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_draw.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/libgraph_tool_draw.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/draw' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/dynamics' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_dynamics.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/dynamics' libtool: install: /usr/bin/install -c .libs/libgraph_tool_dynamics.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/dynamics/libgraph_tool_dynamics.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_dynamics.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/dynamics/libgraph_tool_dynamics.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/dynamics' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/dynamics' /usr/bin/install -c -m 644 ../src/graph/dynamics/graph_continuous.hh ../src/graph/dynamics/graph_discrete.hh ../src/graph/dynamics/graph_normal_bp.hh ../src/graph/dynamics/graph_potts_bp.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/dynamics' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/flow' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_flow.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/flow' libtool: install: /usr/bin/install -c .libs/libgraph_tool_flow.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/flow/libgraph_tool_flow.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_flow.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/flow/libgraph_tool_flow.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/flow' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/flow' /usr/bin/install -c -m 644 ../src/graph/flow/graph_augment.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/flow' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/generation' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_generation.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/generation' libtool: install: /usr/bin/install -c .libs/libgraph_tool_generation.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/generation/libgraph_tool_generation.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_generation.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/generation/libgraph_tool_generation.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/generation' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/generation' /usr/bin/install -c -m 644 ../src/graph/generation/dynamic_sampler.hh ../src/graph/generation/graph_community_network.hh ../src/graph/generation/graph_complete.hh ../src/graph/generation/graph_contract_edges.hh ../src/graph/generation/graph_generation.hh ../src/graph/generation/graph_geometric.hh ../src/graph/generation/graph_knn.hh ../src/graph/generation/graph_lattice.hh ../src/graph/generation/graph_maxent_sbm.hh ../src/graph/generation/graph_parallel.hh ../src/graph/generation/graph_predecessor.hh ../src/graph/generation/graph_price.hh ../src/graph/generation/graph_random_edges.hh ../src/graph/generation/graph_rewiring.hh ../src/graph/generation/graph_sbm.hh ../src/graph/generation/graph_triadic_closure.hh ../src/graph/generation/graph_triangulation.hh ../src/graph/generation/graph_union.hh ../src/graph/generation/sampler.hh ../src/graph/generation/urn_sampler.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/generation' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/inference' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_inference.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/inference' libtool: install: /usr/bin/install -c .libs/libgraph_tool_inference.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/inference/libgraph_tool_inference.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_inference.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/inference/libgraph_tool_inference.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/inference' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_layout.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' libtool: install: /usr/bin/install -c .libs/libgraph_tool_layout.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/libgraph_tool_layout.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_layout.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/libgraph_tool_layout.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/draw' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/layout' /usr/bin/install -c -m 644 ../src/graph/layout/graph_arf.hh ../src/graph/layout/graph_sfdp.hh ../src/graph/layout/quad_tree.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/layout' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/search' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_search.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/search' libtool: install: /usr/bin/install -c .libs/libgraph_tool_search.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/search/libgraph_tool_search.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_search.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/search/libgraph_tool_search.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/search' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/spectral' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_spectral.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/spectral' libtool: install: /usr/bin/install -c .libs/libgraph_tool_spectral.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/spectral/libgraph_tool_spectral.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_spectral.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/spectral/libgraph_tool_spectral.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/spectral' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/spectral' /usr/bin/install -c -m 644 ../src/graph/spectral/graph_adjacency.hh ../src/graph/spectral/graph_incidence.hh ../src/graph/spectral/graph_laplacian.hh ../src/graph/spectral/graph_transition.hh ../src/graph/spectral/graph_nonbacktracking.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/spectral' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/stats' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_stats.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/stats' libtool: install: /usr/bin/install -c .libs/libgraph_tool_stats.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/stats/libgraph_tool_stats.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_stats.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/stats/libgraph_tool_stats.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/stats' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/stats' /usr/bin/install -c -m 644 ../src/graph/stats/graph_histograms.hh ../src/graph/stats/graph_average.hh ../src/graph/stats/graph_distance_sampled.hh ../src/graph/stats/graph_distance.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/stats' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/topology' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_topology.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/topology' libtool: install: /usr/bin/install -c .libs/libgraph_tool_topology.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/topology/libgraph_tool_topology.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_topology.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/topology/libgraph_tool_topology.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/topology' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/topology' /usr/bin/install -c -m 644 ../src/graph/topology/graph_bipartite_weighted_matching.hh ../src/graph/topology/graph_components.hh ../src/graph/topology/graph_kcore.hh ../src/graph/topology/graph_maximal_cliques.hh ../src/graph/topology/graph_percolation.hh ../src/graph/topology/graph_similarity.hh ../src/graph/topology/graph_vertex_similarity.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/topology' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/util' /bin/bash ./libtool --mode=install /usr/bin/install -c libgraph_tool_util.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/util' libtool: install: /usr/bin/install -c .libs/libgraph_tool_util.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/util/libgraph_tool_util.so libtool: install: /usr/bin/install -c .libs/libgraph_tool_util.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/util/libgraph_tool_util.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/util' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/util' /usr/bin/install -c -m 644 ../src/graph/util/graph_search.hh '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/include/util' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' /bin/bash ./libtool --mode=install /usr/bin/install -c libgt_pycairo_aux.la '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw' libtool: install: /usr/bin/install -c .libs/libgt_pycairo_aux.so /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/libgt_pycairo_aux.so libtool: install: /usr/bin/install -c .libs/libgt_pycairo_aux.lai /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/libgt_pycairo_aux.la libtool: warning: remember to run 'libtool --finish /usr/lib/python3.13/dist-packages/graph_tool/draw' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos' /usr/bin/install -c -m 644 ../doc/demos/index.rst '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/src/boost-workaround' /usr/bin/install -c -m 644 ../src/boost-workaround/LICENSE_1_0.txt '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/src/boost-workaround' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc' /usr/bin/install -c -m 644 ../doc/centrality.rst ../doc/correlations.rst ../doc/price.py ../doc/search_module.rst ../doc/util.rst ../doc/clustering.rst ../doc/draw.rst ../doc/index.rst ../doc/spectral.rst ../doc/inference.rst ../doc/flow.rst ../doc/Makefile ../doc/quickstart.rst ../doc/generation.rst ../doc/stats.rst ../doc/graph_tool.rst ../doc/modules.rst ../doc/parallel.rst ../doc/topology.rst ../doc/conf.py ../doc/pyenv.py ../doc/extlinks_fancy.py ../doc/search_example.xml ../doc/mincut-example.xml.gz ../doc/mincut-st-example.xml.gz '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/cppextensions' /usr/bin/install -c -m 644 ../doc/demos/cppextensions/Makefile ../doc/demos/cppextensions/cppextensions.rst ../doc/demos/cppextensions/kcore.cc ../doc/demos/cppextensions/kcore.hh ../doc/demos/cppextensions/kcore.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/cppextensions' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/inference' /usr/bin/install -c -m 644 ../doc/demos/inference/inference.rst ../doc/demos/inference/blockmodel-example.gt.gz ../doc/demos/inference/nested-diagram.svg '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/inference' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/_static' /usr/bin/install -c -m 644 ../doc/_static/graph-tool-logo.svg ../doc/_static/graph-tool-logo-circle.svg '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/_static' /usr/bin/install -c -m 644 ../README.md ../COPYING ../COPYING.LESSER ../AUTHORS ../INSTALL '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/.' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/animation' /usr/bin/install -c -m 644 ../doc/demos/animation/animation.rst ../doc/demos/animation/animation_dancing.py ../doc/demos/animation/animation_sirs.py ../doc/demos/animation/animation_zombies.py ../doc/demos/animation/interactive_bst.py ../doc/demos/animation/face-grin.png ../doc/demos/animation/face-surprise.png ../doc/demos/animation/zombie.png '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/animation' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/sphinxext' /usr/bin/install -c -m 644 ../doc/sphinxext/comment_eater.py ../doc/sphinxext/phantom_import.py ../doc/sphinxext/compiler_unparse.py ../doc/sphinxext/traitsdoc.py '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/sphinxext' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/matplotlib' /usr/bin/install -c -m 644 ../doc/demos/matplotlib/matplotlib.rst '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/share/doc/graph-tool/doc/demos/matplotlib' /usr/bin/mkdir -p '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/x86_64-linux-gnu/pkgconfig' /usr/bin/install -c -m 644 graph-tool-py3.13.pc '/build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/x86_64-linux-gnu/pkgconfig' make[3]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' make[2]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds/_BUILD' TEST STARTED Wed Feb 25 15:37:35 UTC 2026 rm -f _BUILD/test.png PYTHONPATH=/build/reproducible-path/graph-tool-2.77+ds/debian/tmp//usr/lib/python3.13/dist-packages \ python3 -c "\ from graph_tool.all import *; \ show_config(); \ g = random_graph(10, lambda: 5, directed=False); \ graph_draw(g, output='_BUILD/test.png'); \ " /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/cairo_draw.py:52: RuntimeWarning: Error importing matplotlib module. Graph drawing will not work. warnings.warn(msg, RuntimeWarning) /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/draw/cairo_draw.py:52: RuntimeWarning: Error importing matplotlib module. Graph drawing will not work. warnings.warn(msg, RuntimeWarning) /build/reproducible-path/graph-tool-2.77+ds/debian/tmp/usr/lib/python3.13/dist-packages/graph_tool/all.py:39: RuntimeWarning: Error importing draw module, proceeding nevertheless: cannot import name 'Image' from 'PIL' (unknown location) warnings.warn(msg, RuntimeWarning) Traceback (most recent call last): File "", line 1, in from graph_tool.all import *; show_config(); g = random_graph(10, lambda: 5, directed=False); graph_draw(g, output='_BUILD/test.png'); ^^^^^^^^^^ NameError: name 'graph_draw' is not defined version: 2.77 gcc version: 14.2.0 compilation flags: -DBOOST_ALLOW_DEPRECATED_HEADERS -DNDEBUG -Wdate-time -D_FORTIFY_SOURCE=2 -fopenmp -O3 -fvisibility=default -fvisibility-inlines-hidden -Wno-deprecated -Wall -Wextra -ftemplate-backtrace-limit=0 -g -O2 -ffile-prefix-map=/build/reproducible-path/graph-tool-2.77+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -Wl,-z,relro -Wl,-z,now install prefix: /usr python dir: /usr/lib/python3.13/dist-packages graph filtering: True openmp: True uname: Linux infom02-amd64 6.11.10+bpo-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.11.10-1~bpo12+1 (2024-12-19) x86_64 make[1]: *** [debian/rules:59: override_dh_auto_install] Error 1 make[1]: Leaving directory '/build/reproducible-path/graph-tool-2.77+ds' make: *** [debian/rules:37: binary] Error 2 dpkg-buildpackage: error: debian/rules binary subprocess returned exit status 2 I: copying local configuration E: Failed autobuilding of package I: unmounting dev/ptmx filesystem I: unmounting dev/pts filesystem I: unmounting dev/shm filesystem I: unmounting proc filesystem I: unmounting sys filesystem I: cleaning the build env I: removing directory /srv/workspace/pbuilder/750065 and its subdirectories graph-tool failed to build from source. removed '/var/lib/jenkins/userContent/reproducible/debian/rbuild/unstable/amd64/graph-tool_2.77+ds-3.rbuild.log' removed '/var/lib/jenkins/userContent/reproducible/debian/rbuild/unstable/amd64/graph-tool_2.77+ds-3.rbuild.log.gz' removed '/var/lib/jenkins/userContent/reproducible/debian/logs/unstable/amd64/graph-tool_2.77+ds-3.build1.log.gz' removed '/var/lib/jenkins/userContent/reproducible/debian/logs/unstable/amd64/graph-tool_2.77+ds-3.build2.log.gz' removed '/var/lib/jenkins/userContent/reproducible/debian/logdiffs/unstable/amd64/graph-tool_2.77+ds-3.diff.gz' Thu Jan 23 09:15:21 UTC 2025 W: No second build log, what happened? Compressing the 1st log... b1/build.log: 98.2% -- replaced with stdout INSERT 0 1 INSERT 0 1 DELETE 1 [2025-01-23 09:15:24] INFO: Starting at 2025-01-23 09:15:24.056137 [2025-01-23 09:15:24] INFO: Generating the pages of 1 package(s) [2025-01-23 09:15:24] CRITICAL: https://tests.reproducible-builds.org/debian/unstable/amd64/graph-tool didn't produce a buildlog, even though it has been built. [2025-01-23 09:15:24] ERROR: Either /var/lib/jenkins/userContent/reproducible/debian/logs/unstable/armhf/graph-tool_2.77+ds-3.build2.log.gz or /var/lib/jenkins/userContent/reproducible/debian/logdiffs/unstable/armhf/graph-tool_2.77+ds-3.diff.gz is missing [2025-01-23 09:15:24] ERROR: Either /var/lib/jenkins/userContent/reproducible/debian/logs/unstable/i386/graph-tool_2.77+ds-3.build2.log.gz or /var/lib/jenkins/userContent/reproducible/debian/logdiffs/unstable/i386/graph-tool_2.77+ds-3.diff.gz is missing [2025-01-23 09:15:24] ERROR: Either /var/lib/jenkins/userContent/reproducible/debian/logs/bookworm/armhf/graph-tool_2.45+ds-10.build2.log.gz or /var/lib/jenkins/userContent/reproducible/debian/logdiffs/bookworm/armhf/graph-tool_2.45+ds-10.diff.gz is missing [2025-01-23 09:15:24] ERROR: Either /var/lib/jenkins/userContent/reproducible/debian/logs/bookworm/i386/graph-tool_2.45+ds-10.build2.log.gz or /var/lib/jenkins/userContent/reproducible/debian/logdiffs/bookworm/i386/graph-tool_2.45+ds-10.diff.gz is missing [2025-01-23 09:15:24] INFO: Finished at 2025-01-23 09:15:24.299386, took: 0:00:00.243254 Thu Jan 23 09:15:24 UTC 2025 - successfully updated the database and updated https://tests.reproducible-builds.org/debian/rb-pkg/unstable/amd64/graph-tool.html Starting cleanup. /var/lib/jenkins/userContent/reproducible/debian/rbuild/unstable/amd64/graph-tool_2.77+ds-3.rbuild.log: 98.2% -- replaced with /var/lib/jenkins/userContent/reproducible/debian/rbuild/unstable/amd64/graph-tool_2.77+ds-3.rbuild.log.gz [2025-01-23 09:15:25] INFO: Starting at 2025-01-23 09:15:25.121020 [2025-01-23 09:15:25] INFO: Generating the pages of 1 package(s) [2025-01-23 09:15:25] ERROR: Either /var/lib/jenkins/userContent/reproducible/debian/logs/unstable/amd64/graph-tool_2.77+ds-3.build2.log.gz or /var/lib/jenkins/userContent/reproducible/debian/logdiffs/unstable/amd64/graph-tool_2.77+ds-3.diff.gz is missing [2025-01-23 09:15:25] ERROR: Either /var/lib/jenkins/userContent/reproducible/debian/logs/unstable/armhf/graph-tool_2.77+ds-3.build2.log.gz or /var/lib/jenkins/userContent/reproducible/debian/logdiffs/unstable/armhf/graph-tool_2.77+ds-3.diff.gz is missing [2025-01-23 09:15:25] ERROR: Either /var/lib/jenkins/userContent/reproducible/debian/logs/unstable/i386/graph-tool_2.77+ds-3.build2.log.gz or /var/lib/jenkins/userContent/reproducible/debian/logdiffs/unstable/i386/graph-tool_2.77+ds-3.diff.gz is missing [2025-01-23 09:15:25] ERROR: Either /var/lib/jenkins/userContent/reproducible/debian/logs/bookworm/armhf/graph-tool_2.45+ds-10.build2.log.gz or /var/lib/jenkins/userContent/reproducible/debian/logdiffs/bookworm/armhf/graph-tool_2.45+ds-10.diff.gz is missing [2025-01-23 09:15:25] ERROR: Either /var/lib/jenkins/userContent/reproducible/debian/logs/bookworm/i386/graph-tool_2.45+ds-10.build2.log.gz or /var/lib/jenkins/userContent/reproducible/debian/logdiffs/bookworm/i386/graph-tool_2.45+ds-10.diff.gz is missing [2025-01-23 09:15:25] INFO: Finished at 2025-01-23 09:15:25.370749, took: 0:00:00.249734 All cleanup done. Thu Jan 23 09:15:25 UTC 2025 - total duration: 8h 4m 13s. Thu Jan 23 09:15:25 UTC 2025 - reproducible_build.sh stopped running as /tmp/jenkins-script-yaXloj5h, removing. Finished with result: success Main processes terminated with: code=exited/status=0 Service runtime: 8h 4min 15.289s CPU time consumed: 9.478s